Base | Representation |
---|---|
bin | 11101001000111010101… |
… | …11001111100010110011 |
3 | 10112201022202002110121111 |
4 | 32210131113033202303 |
5 | 112400444310342321 |
6 | 2043542031334151 |
7 | 132223110453646 |
oct | 16443527174263 |
9 | 3481282073544 |
10 | 1001220012211 |
11 | 356684660151 |
12 | 142062681357 |
13 | 73550c78b63 |
14 | 366604a5a5d |
15 | 1b09d9065e1 |
hex | e91d5cf8b3 |
1001220012211 has 4 divisors (see below), whose sum is σ = 1002753274752. Its totient is φ = 999686749672.
The previous prime is 1001220012181. The next prime is 1001220012277. The reversal of 1001220012211 is 1122100221001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1001220012211 - 217 = 1001219881139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1001220012191 and 1001220012200.
It is not an unprimeable number, because it can be changed into a prime (1001220012011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 766630291 + ... + 766631596.
It is an arithmetic number, because the mean of its divisors is an integer number (250688318688).
Almost surely, 21001220012211 is an apocalyptic number.
1001220012211 is a deficient number, since it is larger than the sum of its proper divisors (1533262541).
1001220012211 is an equidigital number, since it uses as much as digits as its factorization.
1001220012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1533262540.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1001220012211 its reverse (1122100221001), we get a palindrome (2123320233212).
The spelling of 1001220012211 in words is "one trillion, one billion, two hundred twenty million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •