Number 96
   HOME

TheInfoList



OR:

96 (ninety-six) is the
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
following 95 and preceding 97. It is a number that appears the same when rotated by 180 degrees.


In mathematics

96 is: * an
octagonal number In mathematics, an octagonal number is a figurate number. The ''n''th octagonal number ''o'n'' is the number of dots in a pattern of dots consisting of the outlines of regular octagons with sides up to ''n'' dots, when the octagons are overlai ...
. * a
refactorable number A refactorable number or tau number is an integer ''n'' that is divisible by the count of its divisors, or to put it algebraically, ''n'' is such that \tau(n)\mid n with \tau(n)=\sigma_0(n)=\prod_^(e_i+1) for n=\prod_^np_i^. The first few refact ...
. * an
untouchable number In mathematics, an untouchable number is a positive integer that cannot be expressed as the sum of all the proper divisors of any positive integer. That is, these numbers are not in the image of the aliquot sum function. Their study goes back at l ...
. * a
semiperfect number In number theory, a semiperfect number or pseudoperfect number is a natural number ''n'' that is equal to the sum of all or some of its proper divisors. A semiperfect number that is equal to the sum of all its proper divisors is a perfect number. ...
since it is a multiple of 6. * an
abundant number In number theory, an abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number. The integer 12 is the first abundant number. Its proper divisors are 1, 2, 3, 4 and 6 for a total ...
since the sum of its proper divisors is greater than 96. * the fourth Granville number and the second non-perfect Granville number. The next Granville number is 126, the previous being 24. * the sum of
Euler's totient function In number theory, Euler's totient function counts the positive integers up to a given integer that are relatively prime to . It is written using the Greek letter phi as \varphi(n) or \phi(n), and may also be called Euler's phi function. In ot ...
φ(''x'') over the first seventeen integers. * strobogrammatic in bases 10 (9610), 11 (8811) and 95 (1195). *
palindromic A palindrome ( /ˈpæl.ɪn.droʊm/) is a word, number, phrase, or other sequence of symbols that reads the same backwards as forwards, such as ''madam'' or '' racecar'', the date " 02/02/2020" and the sentence: "A man, a plan, a canal – Pana ...
in bases 11 (8811), 15 (6615), 23 (4423), 31 (3331), 47 (2247) and 95 (1195). * an
Erdős–Woods number In number theory, a positive integer is said to be an Erdős–Woods number if it has the following property: there exists a positive integer such that in the sequence of consecutive integers, each of the elements has a non-trivial common fac ...
, since it is possible to find sequences of 96 consecutive integers such that each inner member shares a factor with either the first or the last member. * divisible by the number of
prime numbers A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways ...
(24) below 96. * the smallest natural number that can be expressed as the difference of two nonzero
squares In geometry, a square is a regular polygon, regular quadrilateral. It has four straight sides of equal length and four equal angles. Squares are special cases of rectangles, which have four equal angles, and of rhombuses, which have four equal si ...
in more than three ways: 10^2-2^2, 11^2-5^2, 14^2-10^2 or 25^2-23^2. The number of
divisor In mathematics, a divisor of an integer n, also called a factor of n, is an integer m that may be multiplied by some integer to produce n. In this case, one also says that n is a '' multiple'' of m. An integer n is divisible or evenly divisibl ...
s of 96 is 12. As no smaller number has more than 12 divisors, 96 is a
largely composite number A highly composite number is a positive integer that has more divisors than all smaller positive integers. If ''d''(''n'') denotes the number of divisors of a positive integer ''n'', then a positive integer ''N'' is highly composite if ''d''(' ...
. Skilling's figure, a degenerate
uniform polyhedron In geometry, a uniform polyhedron has regular polygons as Face (geometry), faces and is vertex-transitive—there is an isometry mapping any vertex onto any other. It follows that all vertices are congruence (geometry), congruent. Uniform po ...
, has a
Euler characteristic In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant, a number that describes a topological space's ...
\chi=-96. Every integer greater than 96 may be represented as a sum of distinct
super-prime Super-prime numbers, also known as higher-order primes or prime-indexed primes (PIPs), are the subsequence of prime numbers that occupy prime-numbered positions within the sequence of all prime numbers. In other words, if prime numbers are matched ...
numbers.


References


External links


On the number 96
{{DEFAULTSORT:96 (Number) Integers