Base | Representation |
---|---|
bin | 11101010000111000111… |
… | …101000011001000010101 |
3 | 21010020202001201001001012 |
4 | 131100320331003020111 |
5 | 230422012024102404 |
6 | 4135501333542005 |
7 | 265201313564555 |
oct | 35207075031025 |
9 | 7106661631035 |
10 | 2011000222229 |
11 | 705951220639 |
12 | 2858b3aa4905 |
13 | 117837538bcb |
14 | 6d4937bb165 |
15 | 3749dab2a6e |
hex | 1d438f43215 |
2011000222229 has 2 divisors, whose sum is σ = 2011000222230. Its totient is φ = 2011000222228.
The previous prime is 2011000222181. The next prime is 2011000222249. The reversal of 2011000222229 is 9222220001102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1829121002500 + 181879219729 = 1352450^2 + 426473^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011000222229 - 224 = 2010983445013 is a prime.
It is a super-3 number, since 3×20110002222293 (a number of 38 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011000222249) 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, 1005500111114 + 1005500111115.
It is an arithmetic number, because the mean of its divisors is an integer number (1005500111115).
Almost surely, 22011000222229 is an apocalyptic number.
It is an amenable number.
2011000222229 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011000222229 is an equidigital number, since it uses as much as digits as its factorization.
2011000222229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
The spelling of 2011000222229 in words is "two trillion, eleven billion, two hundred twenty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •