Base | Representation |
---|---|
bin | 11001000010001100100101… |
… | …010010011001000100001011 |
3 | 112102211122210111200120102122 |
4 | 121002030211102121010023 |
5 | 103412403111211224321 |
6 | 1030100113450521455 |
7 | 32122420660141331 |
oct | 3102144522310413 |
9 | 472748714616378 |
10 | 110102112211211 |
11 | 3209a052a9489a |
12 | 1042263a73628b |
13 | 495877a585c03 |
14 | 1d28d83709b51 |
15 | cae01e0c78ab |
hex | 64232549910b |
110102112211211 has 2 divisors, whose sum is σ = 110102112211212. Its totient is φ = 110102112211210.
The previous prime is 110102112211193. The next prime is 110102112211241. The reversal of 110102112211211 is 112112211201011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110102112211211 - 222 = 110102108016907 is a prime.
It is a super-2 number, since 2×1101021122112112 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110102112211211.
It is not a weakly prime, because it can be changed into another prime (110102112211241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55051056105605 + 55051056105606.
It is an arithmetic number, because the mean of its divisors is an integer number (55051056105606).
Almost surely, 2110102112211211 is an apocalyptic number.
110102112211211 is a deficient number, since it is larger than the sum of its proper divisors (1).
110102112211211 is an equidigital number, since it uses as much as digits as its factorization.
110102112211211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 110102112211211 its reverse (112112211201011), we get a palindrome (222214323412222).
The spelling of 110102112211211 in words is "one hundred ten trillion, one hundred two billion, one hundred twelve million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •