Base | Representation |
---|---|
bin | 10001110001010000100… |
… | …011001001001100000101 |
3 | 11022201221002200001211022 |
4 | 101301100203021030011 |
5 | 130001324224231041 |
6 | 2332550432320525 |
7 | 154136354415263 |
oct | 21612043111405 |
9 | 4281832601738 |
10 | 1221122102021 |
11 | 430969656a58 |
12 | 1787b33a3145 |
13 | 8b1c75b1423 |
14 | 43161863433 |
15 | 21b6e20624b |
hex | 11c508c9305 |
1221122102021 has 8 divisors (see below), whose sum is σ = 1222610747904. Its totient is φ = 1219633628400.
The previous prime is 1221122102003. The next prime is 1221122102029. The reversal of 1221122102021 is 1202012211221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1221122102021 - 218 = 1221121839877 is a prime.
It is a super-2 number, since 2×12211221020212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221122102029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19443971 + ... + 19506671.
It is an arithmetic number, because the mean of its divisors is an integer number (152826343488).
Almost surely, 21221122102021 is an apocalyptic number.
It is an amenable number.
1221122102021 is a deficient number, since it is larger than the sum of its proper divisors (1488645883).
1221122102021 is an equidigital number, since it uses as much as digits as its factorization.
1221122102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86131.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1221122102021 its reverse (1202012211221), we get a palindrome (2423134313242).
The spelling of 1221122102021 in words is "one trillion, two hundred twenty-one billion, one hundred twenty-two million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •