Base | Representation |
---|---|
bin | 11100001110101000… |
… | …010010101001000000 |
3 | 2220020101000102021020 |
4 | 130032220102221000 |
5 | 444033403323313 |
6 | 21531353025440 |
7 | 2122054366311 |
oct | 341650225100 |
9 | 86211012236 |
10 | 30310214208 |
11 | 1194436460a |
12 | 5a5a9b5280 |
13 | 2b2072b0c1 |
14 | 167771a608 |
15 | bc5ea4323 |
hex | 70ea12a40 |
30310214208 has 112 divisors (see below), whose sum is σ = 85082603520. Its totient is φ = 9496134144.
The previous prime is 30310214203. The next prime is 30310214261. The reversal of 30310214208 is 80241201303.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (30310214203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 430585 + ... + 496007.
Almost surely, 230310214208 is an apocalyptic number.
30310214208 is a gapful number since it is divisible by the number (38) 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 30310214208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42541301760).
30310214208 is an abundant number, since it is smaller than the sum of its proper divisors (54772389312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30310214208 is a wasteful number, since it uses less digits than its factorization.
30310214208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65584 (or 65574 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The spelling of 30310214208 in words is "thirty billion, three hundred ten million, two hundred fourteen thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •