Base | Representation |
---|---|
bin | 1101110100011100100001… |
… | …11010000000000000000000 |
3 | 10222121012011021212212102022 |
4 | 12322032100322000000000 |
5 | 12440344314113231111 |
6 | 144344355115341012 |
7 | 6254361540165035 |
oct | 672162072000000 |
9 | 128535137785368 |
10 | 30389324742656 |
11 | 9757049629620 |
12 | 34a97a3451768 |
13 | 13c5916204a69 |
14 | 770bcb85338c |
15 | 37a7693cd2db |
hex | 1ba390e80000 |
30389324742656 has 160 divisors (see below), whose sum is σ = 66420800582400. Its totient is φ = 13788984115200.
The previous prime is 30389324742599. The next prime is 30389324742671. The reversal of 30389324742656 is 65624742398303.
It is a super-2 number, since 2×303893247426562 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3500666636 + ... + 3500675316.
It is an arithmetic number, because the mean of its divisors is an integer number (415130003640).
Almost surely, 230389324742656 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 30389324742656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33210400291200).
30389324742656 is an abundant number, since it is smaller than the sum of its proper divisors (36031475839744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30389324742656 is an frugal number, since it uses more digits than its factorization.
30389324742656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9337 (or 9301 counting only the distinct ones).
The product of its (nonzero) digits is 156764160, while the sum is 62.
The spelling of 30389324742656 in words is "thirty trillion, three hundred eighty-nine billion, three hundred twenty-four million, seven hundred forty-two thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •