Base | Representation |
---|---|
bin | 11100000011111001… |
… | …001101111111000100 |
3 | 2212202211002210001120 |
4 | 130003321031333010 |
5 | 443201301232322 |
6 | 21501440353540 |
7 | 2114436433410 |
oct | 340371157704 |
9 | 85684083046 |
10 | 30130102212 |
11 | 11861725821 |
12 | 5a0a6158b0 |
13 | 2ac2318262 |
14 | 165b833d40 |
15 | bb5277a5c |
hex | 703e4dfc4 |
30130102212 has 96 divisors (see below), whose sum is σ = 84051523584. Its totient is φ = 8213568000.
The previous prime is 30130102183. The next prime is 30130102231. The reversal of 30130102212 is 21220103103.
It is a junction number, because it is equal to n+sod(n) for n = 30130102191 and 30130102200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 755287 + ... + 794177.
It is an arithmetic number, because the mean of its divisors is an integer number (875536704).
Almost surely, 230130102212 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 30130102212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42025761792).
30130102212 is an abundant number, since it is smaller than the sum of its proper divisors (53921421372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30130102212 is a wasteful number, since it uses less digits than its factorization.
30130102212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39329 (or 39327 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 30130102212 its reverse (21220103103), we get a palindrome (51350205315).
The spelling of 30130102212 in words is "thirty billion, one hundred thirty million, one hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •