Base | Representation |
---|---|
bin | 1001101001000010001000… |
… | …00010001111001010000101 |
3 | 2210001210202010000220211122 |
4 | 10310201010002033022011 |
5 | 10234324323100310432 |
6 | 113031352331443325 |
7 | 4315505010452336 |
oct | 464410402171205 |
9 | 83053663026748 |
10 | 21201100010117 |
11 | 6834377275aa5 |
12 | 2464ab95b6545 |
13 | baa341753bb1 |
14 | 5341d28c828d |
15 | 26b75140a612 |
hex | 13484408f285 |
21201100010117 has 2 divisors, whose sum is σ = 21201100010118. Its totient is φ = 21201100010116.
The previous prime is 21201100010059. The next prime is 21201100010191. The reversal of 21201100010117 is 71101000110212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21139111957441 + 61988052676 = 4597729^2 + 248974^2 .
It is a cyclic number.
It is not a de Polignac number, because 21201100010117 - 210 = 21201100009093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21201100010095 and 21201100010104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21201100010617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10600550005058 + 10600550005059.
It is an arithmetic number, because the mean of its divisors is an integer number (10600550005059).
Almost surely, 221201100010117 is an apocalyptic number.
It is an amenable number.
21201100010117 is a deficient number, since it is larger than the sum of its proper divisors (1).
21201100010117 is an equidigital number, since it uses as much as digits as its factorization.
21201100010117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 21201100010117 its reverse (71101000110212), we get a palindrome (92302100120329).
The spelling of 21201100010117 in words is "twenty-one trillion, two hundred one billion, one hundred million, ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •