Base | Representation |
---|---|
bin | 11000000110100100110110… |
… | …101010111100100000101001 |
3 | 111220022222110001202110221121 |
4 | 120012210312222330200221 |
5 | 102343241222243411022 |
6 | 1013242005501335241 |
7 | 31220415563024461 |
oct | 3006446652744051 |
9 | 456288401673847 |
10 | 106005005060137 |
11 | 3085a5198a2367 |
12 | ba80591867521 |
13 | 471c2c93b6891 |
14 | 1c2695361cba1 |
15 | c3c677d5d2c7 |
hex | 606936abc829 |
106005005060137 has 2 divisors, whose sum is σ = 106005005060138. Its totient is φ = 106005005060136.
The previous prime is 106005005060111. The next prime is 106005005060159. The reversal of 106005005060137 is 731060500500601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88788613318441 + 17216391741696 = 9422771^2 + 4149264^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106005005060137 is a prime.
It is a super-2 number, since 2×1060050050601372 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106005005060837) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53002502530068 + 53002502530069.
It is an arithmetic number, because the mean of its divisors is an integer number (53002502530069).
Almost surely, 2106005005060137 is an apocalyptic number.
It is an amenable number.
106005005060137 is a deficient number, since it is larger than the sum of its proper divisors (1).
106005005060137 is an equidigital number, since it uses as much as digits as its factorization.
106005005060137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18900, while the sum is 34.
Adding to 106005005060137 its reverse (731060500500601), we get a palindrome (837065505560738).
The spelling of 106005005060137 in words is "one hundred six trillion, five billion, five million, sixty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •