Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …010111101100010111111 |
3 | 10220100110222110001021102 |
4 | 100002110322331202333 |
5 | 121023404042042231 |
6 | 2202131221123315 |
7 | 142421560253642 |
oct | 20022472754277 |
9 | 3810428401242 |
10 | 1102010112191 |
11 | 3953a5a8503a |
12 | 1596b0b5953b |
13 | 7cbc4383281 |
14 | 3b4a2435a59 |
15 | 1d9ec1aeacb |
hex | 10094ebd8bf |
1102010112191 has 2 divisors, whose sum is σ = 1102010112192. Its totient is φ = 1102010112190.
The previous prime is 1102010112187. The next prime is 1102010112211. The reversal of 1102010112191 is 1912110102011.
It is an a-pointer prime, because the next prime (1102010112211) can be obtained adding 1102010112191 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1102010112191 - 22 = 1102010112187 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102010112391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551005056095 + 551005056096.
It is an arithmetic number, because the mean of its divisors is an integer number (551005056096).
Almost surely, 21102010112191 is an apocalyptic number.
1102010112191 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102010112191 is an equidigital number, since it uses as much as digits as its factorization.
1102010112191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 1102010112191 in words is "one trillion, one hundred two billion, ten million, one hundred twelve thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •