Base | Representation |
---|---|
bin | 10001110000001110010… |
… | …001101001101001011001 |
3 | 11022122001121110121121012 |
4 | 101300032101221221121 |
5 | 124442040104020441 |
6 | 2332244233023305 |
7 | 154066663524140 |
oct | 21601621515131 |
9 | 4278047417535 |
10 | 1220010220121 |
11 | 430448a666a0 |
12 | 178542b54b35 |
13 | 8b07b130444 |
14 | 43097d10757 |
15 | 21b067c49eb |
hex | 11c0e469a59 |
1220010220121 has 96 divisors (see below), whose sum is σ = 1625606267904. Its totient is φ = 888968995200.
The previous prime is 1220010220109. The next prime is 1220010220171. The reversal of 1220010220121 is 1210220100221.
It is not a de Polignac number, because 1220010220121 - 230 = 1218936478297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1220010220096 and 1220010220105.
It is not an unprimeable number, because it can be changed into a prime (1220010220171) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 262761026 + ... + 262765668.
It is an arithmetic number, because the mean of its divisors is an integer number (16933398624).
Almost surely, 21220010220121 is an apocalyptic number.
1220010220121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1220010220121 is a deficient number, since it is larger than the sum of its proper divisors (405596047783).
1220010220121 is a wasteful number, since it uses less digits than its factorization.
1220010220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4843 (or 4812 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1220010220121 its reverse (1210220100221), we get a palindrome (2430230320342).
The spelling of 1220010220121 in words is "one trillion, two hundred twenty billion, ten million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •