Base | Representation |
---|---|
bin | 101111001011111011… |
… | …1010101001011110101 |
3 | 100200120000020122112112 |
4 | 1132113313111023311 |
5 | 3130012010041432 |
6 | 114315030500405 |
7 | 10215050512205 |
oct | 1362767251365 |
9 | 320500218475 |
10 | 101332112117 |
11 | 39a7a376705 |
12 | 1777bb04705 |
13 | 972b7abb72 |
14 | 4c93d40405 |
15 | 298116e7b2 |
hex | 1797dd52f5 |
101332112117 has 2 divisors, whose sum is σ = 101332112118. Its totient is φ = 101332112116.
The previous prime is 101332112111. The next prime is 101332112129. The reversal of 101332112117 is 711211233101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93094552996 + 8237559121 = 305114^2 + 90761^2 .
It is an emirp because it is prime and its reverse (711211233101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101332112117 - 210 = 101332111093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101332112092 and 101332112101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101332112111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50666056058 + 50666056059.
It is an arithmetic number, because the mean of its divisors is an integer number (50666056059).
Almost surely, 2101332112117 is an apocalyptic number.
It is an amenable number.
101332112117 is a deficient number, since it is larger than the sum of its proper divisors (1).
101332112117 is an equidigital number, since it uses as much as digits as its factorization.
101332112117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 23.
Adding to 101332112117 its reverse (711211233101), we get a palindrome (812543345218).
The spelling of 101332112117 in words is "one hundred one billion, three hundred thirty-two million, one hundred twelve thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •