Base | Representation |
---|---|
bin | 1001101001000000010010… |
… | …00010000100100110000111 |
3 | 2210001201012010100211200111 |
4 | 10310200021002010212013 |
5 | 10234320311142023421 |
6 | 113031110210453451 |
7 | 4315441330451401 |
oct | 464401102044607 |
9 | 83051163324614 |
10 | 21200110111111 |
11 | 6833a09521248 |
12 | 2464881b94287 |
13 | baa214642539 |
14 | 53413b249b71 |
15 | 26b6e4571ee1 |
hex | 134809084987 |
21200110111111 has 2 divisors, whose sum is σ = 21200110111112. Its totient is φ = 21200110111110.
The previous prime is 21200110111073. The next prime is 21200110111123. The reversal of 21200110111111 is 11111101100212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21200110111111 - 211 = 21200110109063 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21200110111091 and 21200110111100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21200110111811) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10600055055555 + 10600055055556.
It is an arithmetic number, because the mean of its divisors is an integer number (10600055055556).
Almost surely, 221200110111111 is an apocalyptic number.
21200110111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
21200110111111 is an equidigital number, since it uses as much as digits as its factorization.
21200110111111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 21200110111111 its reverse (11111101100212), we get a palindrome (32311211211323).
The spelling of 21200110111111 in words is "twenty-one trillion, two hundred billion, one hundred ten million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •