Base | Representation |
---|---|
bin | 100000001011001011000… |
… | …011111100111110111011 |
3 | 21211101000210012121012111 |
4 | 200023023003330332323 |
5 | 242211132110014321 |
6 | 4411421211553151 |
7 | 315512064630340 |
oct | 40131303747673 |
9 | 7741023177174 |
10 | 2211020001211 |
11 | 782763170aaa |
12 | 2b861615b7b7 |
13 | 130662991a08 |
14 | 7902a36a7c7 |
15 | 3c7a8b425e1 |
hex | 202cb0fcfbb |
2211020001211 has 8 divisors (see below), whose sum is σ = 2526889242080. Its totient is φ = 1895153070528.
The previous prime is 2211020001209. The next prime is 2211020001227. The reversal of 2211020001211 is 1121000201122.
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 2211020001211 - 21 = 2211020001209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2211020001191 and 2211020001200.
It is not an unprimeable number, because it can be changed into a prime (2211020001011) 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 7 ways as a sum of consecutive naturals, for example, 2756335 + ... + 3466903.
It is an arithmetic number, because the mean of its divisors is an integer number (315861155260).
Almost surely, 22211020001211 is an apocalyptic number.
2211020001211 is a deficient number, since it is larger than the sum of its proper divisors (315869240869).
2211020001211 is an equidigital number, since it uses as much as digits as its factorization.
2211020001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1155093.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2211020001211 its reverse (1121000201122), we get a palindrome (3332020202333).
The spelling of 2211020001211 in words is "two trillion, two hundred eleven billion, twenty million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •