Base | Representation |
---|---|
bin | 11100010001101111… |
… | …001111001111111010 |
3 | 2220101000011001102000 |
4 | 130101233033033322 |
5 | 444140231220340 |
6 | 21540454521430 |
7 | 2123256601215 |
oct | 342157171772 |
9 | 86330131360 |
10 | 30362366970 |
11 | 11970845771 |
12 | 5a74366276 |
13 | 2b2b48b320 |
14 | 168061477c |
15 | bca856d30 |
hex | 711bcf3fa |
30362366970 has 128 divisors (see below), whose sum is σ = 87731078400. Its totient is φ = 7427821824.
The previous prime is 30362366939. The next prime is 30362366971. The reversal of 30362366970 is 7966326303.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (30362366971) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 545596 + ... + 598664.
It is an arithmetic number, because the mean of its divisors is an integer number (685399050).
Almost surely, 230362366970 is an apocalyptic number.
30362366970 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 30362366970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43865539200).
30362366970 is an abundant number, since it is smaller than the sum of its proper divisors (57368711430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30362366970 is a wasteful number, since it uses less digits than its factorization.
30362366970 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53261 (or 53255 counting only the distinct ones).
The product of its (nonzero) digits is 734832, while the sum is 45.
The spelling of 30362366970 in words is "thirty billion, three hundred sixty-two million, three hundred sixty-six thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •