Base | Representation |
---|---|
bin | 1011011111101… |
… | …01110000000000 |
3 | 20201102222222200 |
4 | 11233311300000 |
5 | 144141131013 |
6 | 13322433200 |
7 | 2250421206 |
oct | 557656000 |
9 | 221388880 |
10 | 96427008 |
11 | 4a481047 |
12 | 28362800 |
13 | 16c92402 |
14 | cb41076 |
15 | 86eae73 |
hex | 5bf5c00 |
96427008 has 66 divisors (see below), whose sum is σ = 278457504. Its totient is φ = 32139264.
The previous prime is 96426997. The next prime is 96427057. The reversal of 96427008 is 80072469.
96427008 is a `hidden beast` number, since 9 + 642 + 7 + 0 + 0 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3985 + ... + 14447.
Almost surely, 296427008 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 96427008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139228752).
96427008 is an abundant number, since it is smaller than the sum of its proper divisors (182030496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
96427008 is a wasteful number, since it uses less digits than its factorization.
96427008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10489 (or 10468 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 96427008 is about 9819.7254544106. The cubic root of 96427008 is about 458.5635847911.
It can be divided in two parts, 964 and 27008, that added together give a palindrome (27972).
The spelling of 96427008 in words is "ninety-six million, four hundred twenty-seven thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •