Base | Representation |
---|---|
bin | 101111000101101001… |
… | …0011011100000110101 |
3 | 100200000022012201221201 |
4 | 1132023102123200311 |
5 | 3124044001041432 |
6 | 114242052212501 |
7 | 10206606161644 |
oct | 1361322334065 |
9 | 320008181851 |
10 | 101121112117 |
11 | 39981260243 |
12 | 1772130a131 |
13 | 96c6b72aac |
14 | 4c73cd735b |
15 | 296c890ee7 |
hex | 178b49b835 |
101121112117 has 2 divisors, whose sum is σ = 101121112118. Its totient is φ = 101121112116.
The previous prime is 101121112069. The next prime is 101121112133. The reversal of 101121112117 is 711211121101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62627064516 + 38494047601 = 250254^2 + 196199^2 .
It is a cyclic number.
It is not a de Polignac number, because 101121112117 - 219 = 101120587829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101121112094 and 101121112103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101121112217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560556058 + 50560556059.
It is an arithmetic number, because the mean of its divisors is an integer number (50560556059).
Almost surely, 2101121112117 is an apocalyptic number.
It is an amenable number.
101121112117 is a deficient number, since it is larger than the sum of its proper divisors (1).
101121112117 is an equidigital number, since it uses as much as digits as its factorization.
101121112117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 19.
Adding to 101121112117 its reverse (711211121101), we get a palindrome (812332233218).
The spelling of 101121112117 in words is "one hundred one billion, one hundred twenty-one million, one hundred twelve thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •