Base | Representation |
---|---|
bin | 11000000111100011010000… |
… | …100011001010110001101111 |
3 | 111220120101101211200012010221 |
4 | 120013203100203022301233 |
5 | 102400340434333102002 |
6 | 1013332450444112211 |
7 | 31225310215014436 |
oct | 3007432043126157 |
9 | 456511354605127 |
10 | 106072011222127 |
11 | 30885984052645 |
12 | ba91571b35667 |
13 | 47257174c6642 |
14 | 1c29cac79411d |
15 | c3e29a6e5c37 |
hex | 6078d08cac6f |
106072011222127 has 2 divisors, whose sum is σ = 106072011222128. Its totient is φ = 106072011222126.
The previous prime is 106072011222109. The next prime is 106072011222139. The reversal of 106072011222127 is 721222110270601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 106072011222127 - 211 = 106072011220079 is a prime.
It is a super-2 number, since 2×1060720112221272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106072011222092 and 106072011222101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106072011222157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53036005611063 + 53036005611064.
It is an arithmetic number, because the mean of its divisors is an integer number (53036005611064).
Almost surely, 2106072011222127 is an apocalyptic number.
106072011222127 is a deficient number, since it is larger than the sum of its proper divisors (1).
106072011222127 is an equidigital number, since it uses as much as digits as its factorization.
106072011222127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9408, while the sum is 34.
Adding to 106072011222127 its reverse (721222110270601), we get a palindrome (827294121492728).
The spelling of 106072011222127 in words is "one hundred six trillion, seventy-two billion, eleven million, two hundred twenty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •