Base | Representation |
---|---|
bin | 10001110000001110011… |
… | …000011100011110111011 |
3 | 11022122001201211002210111 |
4 | 101300032120130132323 |
5 | 124442041033014321 |
6 | 2332244335125151 |
7 | 154100014622623 |
oct | 21601630343673 |
9 | 4278051732714 |
10 | 1220012001211 |
11 | 430449a72873 |
12 | 1785436737b7 |
13 | 8b07b605043 |
14 | 43098255883 |
15 | 21b06a275e1 |
hex | 11c0e61c7bb |
1220012001211 has 8 divisors (see below), whose sum is σ = 1222021499904. Its totient is φ = 1218003491880.
The previous prime is 1220012001199. The next prime is 1220012001253. The reversal of 1220012001211 is 1121002100221.
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 1220012001211 - 227 = 1219877783483 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1220012001191 and 1220012001200.
It is not an unprimeable number, because it can be changed into a prime (1220012001281) 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, 2241526 + ... + 2732116.
It is an arithmetic number, because the mean of its divisors is an integer number (152752687488).
Almost surely, 21220012001211 is an apocalyptic number.
1220012001211 is a deficient number, since it is larger than the sum of its proper divisors (2009498693).
1220012001211 is an equidigital number, since it uses as much as digits as its factorization.
1220012001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494681.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1220012001211 its reverse (1121002100221), we get a palindrome (2341014101432).
It can be divided in two parts, 122001 and 2001211, that added together give a palindrome (2123212).
The spelling of 1220012001211 in words is "one trillion, two hundred twenty billion, twelve million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •