Base | Representation |
---|---|
bin | 10110111101110001011100… |
… | …011101010001101011110001 |
3 | 111020121200211012001202001001 |
4 | 112331301130131101223301 |
5 | 101214304100020024332 |
6 | 554451402413242001 |
7 | 30163103524435234 |
oct | 2675613435215361 |
9 | 436550735052031 |
10 | 101002002111217 |
11 | 2a200788090939 |
12 | b3b2a46193301 |
13 | 44485a9147a7c |
14 | 1ad274710341b |
15 | ba2461bb40e7 |
hex | 5bdc5c751af1 |
101002002111217 has 2 divisors, whose sum is σ = 101002002111218. Its totient is φ = 101002002111216.
The previous prime is 101002002111187. The next prime is 101002002111223. The reversal of 101002002111217 is 712111200200101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 68545748743696 + 32456253367521 = 8279236^2 + 5697039^2 .
It is a cyclic number.
It is not a de Polignac number, because 101002002111217 - 243 = 92205909089009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101002002111194 and 101002002111203.
It is not a weakly prime, because it can be changed into another prime (101002002111817) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501001055608 + 50501001055609.
It is an arithmetic number, because the mean of its divisors is an integer number (50501001055609).
Almost surely, 2101002002111217 is an apocalyptic number.
It is an amenable number.
101002002111217 is a deficient number, since it is larger than the sum of its proper divisors (1).
101002002111217 is an equidigital number, since it uses as much as digits as its factorization.
101002002111217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 101002002111217 its reverse (712111200200101), we get a palindrome (813113202311318).
The spelling of 101002002111217 in words is "one hundred one trillion, two billion, two million, one hundred eleven thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •