Base | Representation |
---|---|
bin | 110010000100100111111110… |
… | …000101011010100000010001 |
3 | 1001212201211121212120221201001 |
4 | 302010213332011122200101 |
5 | 212331041301433444303 |
6 | 2100211421004342001 |
7 | 64246243615065034 |
oct | 6204477605324021 |
9 | 1055654555527631 |
10 | 220220120999953 |
11 | 641949131a5668 |
12 | 20848174b44901 |
13 | 95b588c3537c9 |
14 | 3c549d434501b |
15 | 1a6d66da6731d |
hex | c849fe15a811 |
220220120999953 has 2 divisors, whose sum is σ = 220220120999954. Its totient is φ = 220220120999952.
The previous prime is 220220120999939. The next prime is 220220120999993. The reversal of 220220120999953 is 359999021022022.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 216272083140864 + 3948037859089 = 14706192^2 + 1986967^2 .
It is a cyclic number.
It is not a de Polignac number, because 220220120999953 - 221 = 220220118902801 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220220120999894 and 220220120999903.
It is not a weakly prime, because it can be changed into another prime (220220120999993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110110060499976 + 110110060499977.
It is an arithmetic number, because the mean of its divisors is an integer number (110110060499977).
Almost surely, 2220220120999953 is an apocalyptic number.
It is an amenable number.
220220120999953 is a deficient number, since it is larger than the sum of its proper divisors (1).
220220120999953 is an equidigital number, since it uses as much as digits as its factorization.
220220120999953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3149280, while the sum is 55.
The spelling of 220220120999953 in words is "two hundred twenty trillion, two hundred twenty billion, one hundred twenty million, nine hundred ninety-nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •