Base | Representation |
---|---|
bin | 10001110010000101100… |
… | …101111010110100000101 |
3 | 11022211020010012200120022 |
4 | 101302011211322310011 |
5 | 130010140034201041 |
6 | 2333215022344525 |
7 | 154200411542240 |
oct | 21620545726405 |
9 | 4284203180508 |
10 | 1222012022021 |
11 | 431285a2402a |
12 | 178a0142b145 |
13 | 8b309a889cb |
14 | 43207b18257 |
15 | 21bc23e124b |
hex | 11c8597ad05 |
1222012022021 has 8 divisors (see below), whose sum is σ = 1409637366720. Its totient is φ = 1037649727008.
The previous prime is 1222012021963. The next prime is 1222012022027. The reversal of 1222012022021 is 1202202102221.
It is a happy number.
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 1222012022021 - 26 = 1222012021957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222012022027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 815761616 + ... + 815763113.
It is an arithmetic number, because the mean of its divisors is an integer number (176204670840).
Almost surely, 21222012022021 is an apocalyptic number.
It is an amenable number.
1222012022021 is a deficient number, since it is larger than the sum of its proper divisors (187625344699).
1222012022021 is a wasteful number, since it uses less digits than its factorization.
1222012022021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1631524843.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 1222012022021 its reverse (1202202102221), we get a palindrome (2424214124242).
The spelling of 1222012022021 in words is "one trillion, two hundred twenty-two billion, twelve million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •