Base | Representation |
---|---|
bin | 10111001111011111110010… |
… | …110110010110110110000001 |
3 | 111101221010200121212210201221 |
4 | 113033133302312112312001 |
5 | 101344233030224404441 |
6 | 1001223115320555041 |
7 | 30350102626331035 |
oct | 2717376266266601 |
9 | 441833617783657 |
10 | 102220001013121 |
11 | 2a63029377a372 |
12 | b56ab07622a81 |
13 | 45063c666a294 |
14 | 1b3568dc501c5 |
15 | bc3e9badc8d1 |
hex | 5cf7f2d96d81 |
102220001013121 has 2 divisors, whose sum is σ = 102220001013122. Its totient is φ = 102220001013120.
The previous prime is 102220001013079. The next prime is 102220001013181. The reversal of 102220001013121 is 121310100022201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69676398923121 + 32543602090000 = 8347239^2 + 5704700^2 .
It is a cyclic number.
It is not a de Polignac number, because 102220001013121 - 217 = 102220000882049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102220001013095 and 102220001013104.
It is not a weakly prime, because it can be changed into another prime (102220001013181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51110000506560 + 51110000506561.
It is an arithmetic number, because the mean of its divisors is an integer number (51110000506561).
Almost surely, 2102220001013121 is an apocalyptic number.
It is an amenable number.
102220001013121 is a deficient number, since it is larger than the sum of its proper divisors (1).
102220001013121 is an equidigital number, since it uses as much as digits as its factorization.
102220001013121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102220001013121 its reverse (121310100022201), we get a palindrome (223530101035322).
The spelling of 102220001013121 in words is "one hundred two trillion, two hundred twenty billion, one million, thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •