Base | Representation |
---|---|
bin | 1001101001000001111100… |
… | …01100110001110010011111 |
3 | 2210001210111021211002021111 |
4 | 10310200332030301302133 |
5 | 10234324123020010421 |
6 | 113031334513242451 |
7 | 4315502411354515 |
oct | 464407614616237 |
9 | 83053437732244 |
10 | 21201002110111 |
11 | 6834326a892aa |
12 | 2464a90863427 |
13 | baa3273971b5 |
14 | 5341c38c24b5 |
15 | 26b747a1cee1 |
hex | 13483e331c9f |
21201002110111 has 16 divisors (see below), whose sum is σ = 22685648650560. Its totient is φ = 19742858403840.
The previous prime is 21201002110087. The next prime is 21201002110121. The reversal of 21201002110111 is 11101120010212.
It is a happy number.
It is not a de Polignac number, because 21201002110111 - 27 = 21201002109983 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21201002110091 and 21201002110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21201002110121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4404091 + ... + 7861171.
It is an arithmetic number, because the mean of its divisors is an integer number (1417853040660).
Almost surely, 221201002110111 is an apocalyptic number.
21201002110111 is a deficient number, since it is larger than the sum of its proper divisors (1484646540449).
21201002110111 is a wasteful number, since it uses less digits than its factorization.
21201002110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3460914.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21201002110111 its reverse (11101120010212), we get a palindrome (32302122120323).
The spelling of 21201002110111 in words is "twenty-one trillion, two hundred one billion, two million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •