Base | Representation |
---|---|
bin | 11100010000000001… |
… | …101010010100010000 |
3 | 2220022000002200011020 |
4 | 130100001222110100 |
5 | 444110403021000 |
6 | 21533551115440 |
7 | 2122460463024 |
oct | 342001522420 |
9 | 86260080136 |
10 | 30333642000 |
11 | 11956606222 |
12 | 5a66812b80 |
13 | 2b255417bc |
14 | 167a898384 |
15 | bc8080ba0 |
hex | 71006a510 |
30333642000 has 160 divisors (see below), whose sum is σ = 102048111360. Its totient is φ = 7737241600.
The previous prime is 30333641993. The next prime is 30333642019. The reversal of 30333642000 is 24633303.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28096 + ... + 247904.
It is an arithmetic number, because the mean of its divisors is an integer number (637800696).
Almost surely, 230333642000 is an apocalyptic number.
30333642000 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 30333642000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51024055680).
30333642000 is an abundant number, since it is smaller than the sum of its proper divisors (71714469360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30333642000 is a wasteful number, since it uses less digits than its factorization.
30333642000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219858 (or 219842 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 24.
The spelling of 30333642000 in words is "thirty billion, three hundred thirty-three million, six hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •