Base | Representation |
---|---|
bin | 1001101100110110001010… |
… | …11011111000000101101101 |
3 | 2210112022221010021120210021 |
4 | 10312123011123320011231 |
5 | 10244001140210323432 |
6 | 113211501325042141 |
7 | 4331123551212466 |
oct | 466330533700555 |
9 | 83468833246707 |
10 | 21332120011117 |
11 | 68849a0689a63 |
12 | 24863839b6351 |
13 | bb97c1a495c6 |
14 | 53a6a1629d6d |
15 | 26ed6daa1697 |
hex | 1366c56f816d |
21332120011117 has 2 divisors, whose sum is σ = 21332120011118. Its totient is φ = 21332120011116.
The previous prime is 21332120010983. The next prime is 21332120011123. The reversal of 21332120011117 is 71111002123312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19531193586921 + 1800926424196 = 4419411^2 + 1341986^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21332120011117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21332120011091 and 21332120011100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21332120011127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10666060005558 + 10666060005559.
It is an arithmetic number, because the mean of its divisors is an integer number (10666060005559).
Almost surely, 221332120011117 is an apocalyptic number.
It is an amenable number.
21332120011117 is a deficient number, since it is larger than the sum of its proper divisors (1).
21332120011117 is an equidigital number, since it uses as much as digits as its factorization.
21332120011117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 21332120011117 its reverse (71111002123312), we get a palindrome (92443122134429).
The spelling of 21332120011117 in words is "twenty-one trillion, three hundred thirty-two billion, one hundred twenty million, eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •