Base | Representation |
---|---|
bin | 11100100001110000… |
… | …011000111111111000 |
3 | 2221001201211100000000 |
4 | 130201300120333320 |
5 | 1000213030321004 |
6 | 22023254513000 |
7 | 2133032043450 |
oct | 344160307770 |
9 | 87051740000 |
10 | 30631104504 |
11 | 11a99507200 |
12 | 5b2a365760 |
13 | 2b72061610 |
14 | 16a81aad60 |
15 | be423cc39 |
hex | 721c18ff8 |
30631104504 has 864 divisors, whose sum is σ = 118739144160. Its totient is φ = 7205552640.
The previous prime is 30631104487. The next prime is 30631104527. The reversal of 30631104504 is 40540113603.
30631104504 is a `hidden beast` number, since 306 + 311 + 0 + 45 + 0 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 577945342 + ... + 577945394.
It is an arithmetic number, because the mean of its divisors is an integer number (137429565).
Almost surely, 230631104504 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 30631104504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59369572080).
30631104504 is an abundant number, since it is smaller than the sum of its proper divisors (88108039656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30631104504 is a wasteful number, since it uses less digits than its factorization.
30631104504 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125 (or 89 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Subtracting 30631104504 from its reverse (40540113603), we obtain a palindrome (9909009099).
The spelling of 30631104504 in words is "thirty billion, six hundred thirty-one million, one hundred four thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •