Base | Representation |
---|---|
bin | 11100000011011011… |
… | …011111100101110000 |
3 | 2212202021102220011010 |
4 | 130003123133211300 |
5 | 443142302410000 |
6 | 21501001350520 |
7 | 2114313260526 |
oct | 340333374560 |
9 | 85667386133 |
10 | 30122310000 |
11 | 11858293382 |
12 | 5a07a98440 |
13 | 2ac081a593 |
14 | 165a7a6316 |
15 | bb4738d50 |
hex | 7036df970 |
30122310000 has 100 divisors (see below), whose sum is σ = 97238929832. Its totient is φ = 8032608000.
The previous prime is 30122309999. The next prime is 30122310017. The reversal of 30122310000 is 1322103.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×301223100002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 472039 + ... + 532038.
Almost surely, 230122310000 is an apocalyptic number.
30122310000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30122310000 is an abundant number, since it is smaller than the sum of its proper divisors (67116619832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30122310000 is a wasteful number, since it uses less digits than its factorization.
30122310000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1004108 (or 1004087 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 30122310000 its reverse (1322103), we get a palindrome (30123632103).
The spelling of 30122310000 in words is "thirty billion, one hundred twenty-two million, three hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •