Base | Representation |
---|---|
bin | 10001110010001100001… |
… | …001011101001100111011 |
3 | 11022211111210011012122122 |
4 | 101302030021131030323 |
5 | 130010401213014321 |
6 | 2333233551511455 |
7 | 154203215416256 |
oct | 21621411351473 |
9 | 4284453135578 |
10 | 1222122001211 |
11 | 431332011021 |
12 | 178a3222858b |
13 | 8b3267b4757 |
14 | 4321858609d |
15 | 21bcbdb78ab |
hex | 11c8c25d33b |
1222122001211 has 8 divisors (see below), whose sum is σ = 1300514104800. Its totient is φ = 1144452405888.
The previous prime is 1222122001193. The next prime is 1222122001223. The reversal of 1222122001211 is 1121002212221.
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 1222122001211 - 26 = 1222122001147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
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 1222122001211.
It is not an unprimeable number, because it can be changed into a prime (1222122001241) 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, 180623576 + ... + 180630341.
It is an arithmetic number, because the mean of its divisors is an integer number (162564263100).
Almost surely, 21222122001211 is an apocalyptic number.
1222122001211 is a deficient number, since it is larger than the sum of its proper divisors (78392103589).
1222122001211 is a wasteful number, since it uses less digits than its factorization.
1222122001211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 361254133.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1222122001211 its reverse (1121002212221), we get a palindrome (2343124213432).
The spelling of 1222122001211 in words is "one trillion, two hundred twenty-two billion, one hundred twenty-two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •