Base | Representation |
---|---|
bin | 11100110011111110… |
… | …110100110010000000 |
3 | 2221212001012020200000 |
4 | 130303332310302000 |
5 | 1001324320100313 |
6 | 22113500400000 |
7 | 2143434061125 |
oct | 346376646200 |
9 | 87761166600 |
10 | 30936878208 |
11 | 12136074545 |
12 | 5bb4846000 |
13 | 2bc05013c2 |
14 | 16d6a4474c |
15 | c10edc673 |
hex | 733fb4c80 |
30936878208 has 192 divisors, whose sum is σ = 92513322720. Its totient is φ = 10290862080.
The previous prime is 30936878177. The next prime is 30936878243. The reversal of 30936878208 is 80287863903.
30936878208 is a `hidden beast` number, since 3 + 0 + 9 + 368 + 78 + 208 = 666.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23669491 + ... + 23670797.
Almost surely, 230936878208 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 30936878208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46256661360).
30936878208 is an abundant number, since it is smaller than the sum of its proper divisors (61576444512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30936878208 is an equidigital number, since it uses as much as digits as its factorization.
30936878208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2097 (or 2073 counting only the distinct ones).
The product of its (nonzero) digits is 3483648, while the sum is 54.
The spelling of 30936878208 in words is "thirty billion, nine hundred thirty-six million, eight hundred seventy-eight thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •