Base | Representation |
---|---|
bin | 11100101100101001… |
… | …111010010010000000 |
3 | 2221112110220010000000 |
4 | 130230221322102000 |
5 | 1001101333031300 |
6 | 22053350000000 |
7 | 2140412204040 |
oct | 345451722200 |
9 | 87473803000 |
10 | 30813955200 |
11 | 12082746686 |
12 | 5b7b646000 |
13 | 2ba0bc2bb2 |
14 | 16c45a7720 |
15 | c0530ac00 |
hex | 72ca7a480 |
30813955200 has 1536 divisors, whose sum is σ = 141880204800. Its totient is φ = 6449725440.
The previous prime is 30813955189. The next prime is 30813955219. The reversal of 30813955200 is 255931803.
30813955200 is a `hidden beast` number, since 30 + 8 + 13 + 95 + 520 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 832809582 + ... + 832809618.
It is an arithmetic number, because the mean of its divisors is an integer number (92369925).
Almost surely, 230813955200 is an apocalyptic number.
30813955200 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 30813955200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70940102400).
30813955200 is an abundant number, since it is smaller than the sum of its proper divisors (111066249600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30813955200 is an equidigital number, since it uses as much as digits as its factorization.
30813955200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106 (or 71 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The spelling of 30813955200 in words is "thirty billion, eight hundred thirteen million, nine hundred fifty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •