Base | Representation |
---|---|
bin | 10011100011101100… |
… | …101011100110000001 |
3 | 2000012112020001020100 |
4 | 103203230223212001 |
5 | 321002000310423 |
6 | 13351451033013 |
7 | 1342254066165 |
oct | 234354534601 |
9 | 60175201210 |
10 | 21000010113 |
11 | 89a6a5a465 |
12 | 40a0a3b769 |
13 | 1c989195b4 |
14 | 1033036ca5 |
15 | 82d950343 |
hex | 4e3b2b981 |
21000010113 has 12 divisors (see below), whose sum is σ = 30345960528. Its totient is φ = 13994185560.
The previous prime is 21000010103. The next prime is 21000010133. The reversal of 21000010113 is 31101000012.
It is not a de Polignac number, because 21000010113 - 28 = 21000009857 is a prime.
It is a super-2 number, since 2×210000101132 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 21000010095 and 21000010104.
It is not an unprimeable number, because it can be changed into a prime (21000010103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 462195 + ... + 505592.
It is an arithmetic number, because the mean of its divisors is an integer number (2528830044).
Almost surely, 221000010113 is an apocalyptic number.
It is an amenable number.
21000010113 is a deficient number, since it is larger than the sum of its proper divisors (9345950415).
21000010113 is a wasteful number, since it uses less digits than its factorization.
21000010113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 970204 (or 970201 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 21000010113 its reverse (31101000012), we get a palindrome (52101010125).
The spelling of 21000010113 in words is "twenty-one billion, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •