Base | Representation |
---|---|
bin | 10001110010000101100… |
… | …110101011101001000101 |
3 | 11022211020010120211220201 |
4 | 101302011212223221011 |
5 | 130010140112101041 |
6 | 2333215030530501 |
7 | 154200413334313 |
oct | 21620546535105 |
9 | 4284203524821 |
10 | 1222012222021 |
11 | 431286050318 |
12 | 178a01506a31 |
13 | 8b309b28a56 |
14 | 43207b6b0b3 |
15 | 21bc2430631 |
hex | 11c859aba45 |
1222012222021 has 16 divisors (see below), whose sum is σ = 1253286422784. Its totient is φ = 1190967683904.
The previous prime is 1222012221973. The next prime is 1222012222073. The reversal of 1222012222021 is 1202222102221.
It is a cyclic number.
It is not a de Polignac number, because 1222012222021 - 27 = 1222012221893 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1222012222021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222012222091) 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 15 ways as a sum of consecutive naturals, for example, 11394370 + ... + 11501116.
It is an arithmetic number, because the mean of its divisors is an integer number (78330401424).
Almost surely, 21222012222021 is an apocalyptic number.
It is an amenable number.
1222012222021 is a deficient number, since it is larger than the sum of its proper divisors (31274200763).
1222012222021 is a wasteful number, since it uses less digits than its factorization.
1222012222021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107820.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 1222012222021 its reverse (1202222102221), we get a palindrome (2424234324242).
The spelling of 1222012222021 in words is "one trillion, two hundred twenty-two billion, twelve million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •