Base | Representation |
---|---|
bin | 11100100010010010… |
… | …101111101100000000 |
3 | 2221002100202212200100 |
4 | 130202102233230000 |
5 | 1000222332012321 |
6 | 22024215522400 |
7 | 2133201432513 |
oct | 344222575400 |
9 | 87070685610 |
10 | 30640110336 |
11 | 11aa35a8440 |
12 | 5b31389400 |
13 | 2b73b95804 |
14 | 16a9472d7a |
15 | be4e1b326 |
hex | 7224afb00 |
30640110336 has 432 divisors, whose sum is σ = 101322224640. Its totient is φ = 8819712000.
The previous prime is 30640110311. The next prime is 30640110343. The reversal of 30640110336 is 63301104603.
30640110336 is a `hidden beast` number, since 3 + 0 + 640 + 1 + 10 + 3 + 3 + 6 = 666.
It is a super-2 number, since 2×306401103362 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 46353846 + ... + 46354506.
Almost surely, 230640110336 is an apocalyptic number.
30640110336 is a gapful number since it is divisible by the number (36) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30640110336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50661112320).
30640110336 is an abundant number, since it is smaller than the sum of its proper divisors (70682114304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30640110336 is a wasteful number, since it uses less digits than its factorization.
30640110336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 784 (or 767 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 30640110336 its reverse (63301104603), we get a palindrome (93941214939).
The spelling of 30640110336 in words is "thirty billion, six hundred forty million, one hundred ten thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •