Base | Representation |
---|---|
bin | 11100000011010010… |
… | …110001000001100001 |
3 | 2212202010010122202120 |
4 | 130003102301001201 |
5 | 443141211201423 |
6 | 21500440334453 |
7 | 2114254651356 |
oct | 340322610141 |
9 | 85663118676 |
10 | 30120022113 |
11 | 11856a70465 |
12 | 5a07174429 |
13 | 2ac01c90bc |
14 | 165a36c62d |
15 | bb4435ee3 |
hex | 7034b1061 |
30120022113 has 4 divisors (see below), whose sum is σ = 40160029488. Its totient is φ = 20080014740.
The previous prime is 30120022111. The next prime is 30120022129. The reversal of 30120022113 is 31122002103.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30120022113 - 21 = 30120022111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30120022092 and 30120022101.
It is not an unprimeable number, because it can be changed into a prime (30120022111) 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 3 ways as a sum of consecutive naturals, for example, 5020003683 + ... + 5020003688.
It is an arithmetic number, because the mean of its divisors is an integer number (10040007372).
Almost surely, 230120022113 is an apocalyptic number.
It is an amenable number.
30120022113 is a deficient number, since it is larger than the sum of its proper divisors (10040007375).
30120022113 is a wasteful number, since it uses less digits than its factorization.
30120022113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10040007374.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 30120022113 its reverse (31122002103), we get a palindrome (61242024216).
The spelling of 30120022113 in words is "thirty billion, one hundred twenty million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •