Base | Representation |
---|---|
bin | 10000000010011011000… |
… | …000000000111100101001 |
3 | 10220100202002100120102202 |
4 | 100002123000000330221 |
5 | 121024111144201022 |
6 | 2202145303105545 |
7 | 142424236165616 |
oct | 20023300007451 |
9 | 3810662316382 |
10 | 1102112100137 |
11 | 3954486040a4 |
12 | 15971b1422b5 |
13 | 7cc0c541879 |
14 | 3b4b1bc350d |
15 | 1da06108592 |
hex | 1009b000f29 |
1102112100137 has 2 divisors, whose sum is σ = 1102112100138. Its totient is φ = 1102112100136.
The previous prime is 1102112100107. The next prime is 1102112100149. The reversal of 1102112100137 is 7310012112011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1101805009561 + 307090576 = 1049669^2 + 17524^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102112100137 - 224 = 1102095322921 is a prime.
It is not a weakly prime, because it can be changed into another prime (1102112100107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551056050068 + 551056050069.
It is an arithmetic number, because the mean of its divisors is an integer number (551056050069).
Almost surely, 21102112100137 is an apocalyptic number.
It is an amenable number.
1102112100137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102112100137 is an equidigital number, since it uses as much as digits as its factorization.
1102112100137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 1102112100137 its reverse (7310012112011), we get a palindrome (8412124212148).
The spelling of 1102112100137 in words is "one trillion, one hundred two billion, one hundred twelve million, one hundred thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •