Base | Representation |
---|---|
bin | 1101101100000011111001… |
… | …00001101111011000110000 |
3 | 10221120122111210001001021010 |
4 | 12312001330201233120300 |
5 | 12421134244311430000 |
6 | 144004150511430520 |
7 | 6224512202425410 |
oct | 666017441573060 |
9 | 127518453031233 |
10 | 30101220030000 |
11 | 9655945a73809 |
12 | 3461999825440 |
13 | 13a46c0937122 |
14 | 760c9a472640 |
15 | 3730061a8d50 |
hex | 1b607c86f630 |
30101220030000 has 800 divisors, whose sum is σ = 115339623505920. Its totient is φ = 6619628160000.
The previous prime is 30101220029987. The next prime is 30101220030031. The reversal of 30101220030000 is 3002210103.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 582304155 + ... + 582355845.
Almost surely, 230101220030000 is an apocalyptic number.
30101220030000 is a gapful number since it is divisible by the number (30) 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 30101220030000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57669811752960).
30101220030000 is an abundant number, since it is smaller than the sum of its proper divisors (85238403475920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30101220030000 is a wasteful number, since it uses less digits than its factorization.
30101220030000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51835 (or 51814 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 30101220030000 its reverse (3002210103), we get a palindrome (30104222240103).
The spelling of 30101220030000 in words is "thirty trillion, one hundred one billion, two hundred twenty million, thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •