Base | Representation |
---|---|
bin | 10000000010011011000… |
… | …111101100001001100101 |
3 | 10220100202020010210022221 |
4 | 100002123013230021211 |
5 | 121024112203041401 |
6 | 2202145414152341 |
7 | 142424262245452 |
oct | 20023307541145 |
9 | 3810666123287 |
10 | 1102114112101 |
11 | 395449758782 |
12 | 15971b9526b1 |
13 | 7cc0ca97592 |
14 | 3b4b2188829 |
15 | 1da063a47a1 |
hex | 1009b1ec265 |
1102114112101 has 2 divisors, whose sum is σ = 1102114112102. Its totient is φ = 1102114112100.
The previous prime is 1102114111957. The next prime is 1102114112153. The reversal of 1102114112101 is 1012114112011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 769525455076 + 332588657025 = 877226^2 + 576705^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102114112101 - 217 = 1102113981029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102114112161) 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, 551057056050 + 551057056051.
It is an arithmetic number, because the mean of its divisors is an integer number (551057056051).
Almost surely, 21102114112101 is an apocalyptic number.
It is an amenable number.
1102114112101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102114112101 is an equidigital number, since it uses as much as digits as its factorization.
1102114112101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 1102114112101 its reverse (1012114112011), we get a palindrome (2114228224112).
The spelling of 1102114112101 in words is "one trillion, one hundred two billion, one hundred fourteen million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •