Base | Representation |
---|---|
bin | 11000000110100100110110… |
… | …101010111100100000001111 |
3 | 111220022222110001202110220122 |
4 | 120012210312222330200033 |
5 | 102343241222243410421 |
6 | 1013242005501335155 |
7 | 31220415563024423 |
oct | 3006446652744017 |
9 | 456288401673818 |
10 | 106005005060111 |
11 | 3085a5198a2343 |
12 | ba805918674bb |
13 | 471c2c93b6871 |
14 | 1c2695361cb83 |
15 | c3c677d5d2ab |
hex | 606936abc80f |
106005005060111 has 2 divisors, whose sum is σ = 106005005060112. Its totient is φ = 106005005060110.
The previous prime is 106005005060077. The next prime is 106005005060137. The reversal of 106005005060111 is 111060500500601.
It is an a-pointer prime, because the next prime (106005005060137) can be obtained adding 106005005060111 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 106005005060111 - 214 = 106005005043727 is a prime.
It is a super-2 number, since 2×1060050050601112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106005005066111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53002502530055 + 53002502530056.
It is an arithmetic number, because the mean of its divisors is an integer number (53002502530056).
Almost surely, 2106005005060111 is an apocalyptic number.
106005005060111 is a deficient number, since it is larger than the sum of its proper divisors (1).
106005005060111 is an equidigital number, since it uses as much as digits as its factorization.
106005005060111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 106005005060111 its reverse (111060500500601), we get a palindrome (217065505560712).
The spelling of 106005005060111 in words is "one hundred six trillion, five billion, five million, sixty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •