Base | Representation |
---|---|
bin | 100000001011010110011… |
… | …101010100101001100011 |
3 | 21211101112002222120011201 |
4 | 200023112131110221203 |
5 | 242212030031413443 |
6 | 4411452202022031 |
7 | 315516606043441 |
oct | 40132635245143 |
9 | 7741462876151 |
10 | 2211211201123 |
11 | 782851093361 |
12 | 2b866a1a7917 |
13 | 130693487662 |
14 | 790478dbb91 |
15 | 3c7ba80e34d |
hex | 202d6754a63 |
2211211201123 has 2 divisors, whose sum is σ = 2211211201124. Its totient is φ = 2211211201122.
The previous prime is 2211211201099. The next prime is 2211211201141. The reversal of 2211211201123 is 3211021121122.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2211211201123 is a prime.
It is a super-2 number, since 2×22112112011232 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2211211201123.
It is not a weakly prime, because it can be changed into another prime (2211211201153) 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 as a sum of consecutive naturals, namely, 1105605600561 + 1105605600562.
It is an arithmetic number, because the mean of its divisors is an integer number (1105605600562).
Almost surely, 22211211201123 is an apocalyptic number.
2211211201123 is a deficient number, since it is larger than the sum of its proper divisors (1).
2211211201123 is an equidigital number, since it uses as much as digits as its factorization.
2211211201123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 2211211201123 its reverse (3211021121122), we get a palindrome (5422232322245).
The spelling of 2211211201123 in words is "two trillion, two hundred eleven billion, two hundred eleven million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •