Base | Representation |
---|---|
bin | 10000000010011010010… |
… | …101101011001110100001 |
3 | 10220100201022110200110002 |
4 | 100002122111223032201 |
5 | 121024100324013441 |
6 | 2202144225145345 |
7 | 142424042641151 |
oct | 20023225531641 |
9 | 3810638420402 |
10 | 1102101001121 |
11 | 39544231325a |
12 | 15971748b255 |
13 | 7cc0a1569c3 |
14 | 3b4b0534761 |
15 | 1da05164b9b |
hex | 1009a56b3a1 |
1102101001121 has 2 divisors, whose sum is σ = 1102101001122. Its totient is φ = 1102101001120.
The previous prime is 1102101001073. The next prime is 1102101001123. The reversal of 1102101001121 is 1211001012011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 620055454096 + 482045547025 = 787436^2 + 694295^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102101001121 is a prime.
Together with 1102101001123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1102101001123) 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 as a sum of consecutive naturals, namely, 551050500560 + 551050500561.
It is an arithmetic number, because the mean of its divisors is an integer number (551050500561).
Almost surely, 21102101001121 is an apocalyptic number.
It is an amenable number.
1102101001121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102101001121 is an equidigital number, since it uses as much as digits as its factorization.
1102101001121 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 1102101001121 its reverse (1211001012011), we get a palindrome (2313102013132).
The spelling of 1102101001121 in words is "one trillion, one hundred two billion, one hundred one million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •