Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …011010101011100111111 |
3 | 10220100110222122000121002 |
4 | 100002110323111130333 |
5 | 121023404103210421 |
6 | 2202131223200515 |
7 | 142421561142266 |
oct | 20022473253477 |
9 | 3810428560532 |
10 | 1102010210111 |
11 | 3953a6041668 |
12 | 1596b0ba613b |
13 | 7cbc43b8a05 |
14 | 3b4a245d5dd |
15 | 1d9ec1cdb0b |
hex | 10094ed573f |
1102010210111 has 2 divisors, whose sum is σ = 1102010210112. Its totient is φ = 1102010210110.
The previous prime is 1102010210071. The next prime is 1102010210129. The reversal of 1102010210111 is 1110120102011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1102010210111 - 226 = 1101943101247 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102010210092 and 1102010210101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102010210311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551005105055 + 551005105056.
It is an arithmetic number, because the mean of its divisors is an integer number (551005105056).
Almost surely, 21102010210111 is an apocalyptic number.
1102010210111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102010210111 is an equidigital number, since it uses as much as digits as its factorization.
1102010210111 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 11.
Adding to 1102010210111 its reverse (1110120102011), we get a palindrome (2212130312122).
The spelling of 1102010210111 in words is "one trillion, one hundred two billion, ten million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •