Base | Representation |
---|---|
bin | 10001110001001010100… |
… | …101010100101100001001 |
3 | 11022201200010022212112220 |
4 | 101301022211110230021 |
5 | 130001123113310441 |
6 | 2332532455124253 |
7 | 154134030561204 |
oct | 21611245245411 |
9 | 4281603285486 |
10 | 1221022010121 |
11 | 430918102481 |
12 | 178785973689 |
13 | 8b1ac937b54 |
14 | 4315244a93b |
15 | 21b65534466 |
hex | 11c4a954b09 |
1221022010121 has 8 divisors (see below), whose sum is σ = 1628045404224. Its totient is φ = 814006644720.
The previous prime is 1221022010111. The next prime is 1221022010141. The reversal of 1221022010121 is 1210102201221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1221022010121 - 219 = 1221021485833 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1221022010121.
It is not an unprimeable number, because it can be changed into a prime (1221022010111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1642870 + ... + 2267391.
It is an arithmetic number, because the mean of its divisors is an integer number (203505675528).
Almost surely, 21221022010121 is an apocalyptic number.
It is an amenable number.
1221022010121 is a deficient number, since it is larger than the sum of its proper divisors (407023394103).
1221022010121 is a wasteful number, since it uses less digits than its factorization.
1221022010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4014351.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1221022010121 its reverse (1210102201221), we get a palindrome (2431124211342).
The spelling of 1221022010121 in words is "one trillion, two hundred twenty-one billion, twenty-two million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •