Base | Representation |
---|---|
bin | 10011101010011000… |
… | …000000001110100001 |
3 | 2000111100000020210020 |
4 | 103222120000032201 |
5 | 321214134430423 |
6 | 13410532024053 |
7 | 1345114203126 |
oct | 235230001641 |
9 | 60440006706 |
10 | 21112030113 |
11 | 8a54210779 |
12 | 4112462029 |
13 | 1cb5bab215 |
14 | 1043c7674d |
15 | 8386cb4e3 |
hex | 4ea6003a1 |
21112030113 has 8 divisors (see below), whose sum is σ = 28176470400. Its totient is φ = 14061138288.
The previous prime is 21112030111. The next prime is 21112030171. The reversal of 21112030113 is 31103021112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21112030113 - 21 = 21112030111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21112030092 and 21112030101.
It is not an unprimeable number, because it can be changed into a prime (21112030111) 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 7 ways as a sum of consecutive naturals, for example, 3383478 + ... + 3389711.
It is an arithmetic number, because the mean of its divisors is an integer number (3522058800).
Almost surely, 221112030113 is an apocalyptic number.
It is an amenable number.
21112030113 is a deficient number, since it is larger than the sum of its proper divisors (7064440287).
21112030113 is a wasteful number, since it uses less digits than its factorization.
21112030113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6774231.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 21112030113 its reverse (31103021112), we get a palindrome (52215051225).
Subtracting 21112030113 from its reverse (31103021112), we obtain a palindrome (9990990999).
The spelling of 21112030113 in words is "twenty-one billion, one hundred twelve million, thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •