Base | Representation |
---|---|
bin | 11101010001111011001… |
… | …011000110001111001011 |
3 | 21010100121111012121201111 |
4 | 131101323023012033023 |
5 | 230431300431414402 |
6 | 4140203502031151 |
7 | 265240664005441 |
oct | 35217313061713 |
9 | 7110544177644 |
10 | 2012111201227 |
11 | 7063713545a6 |
12 | 285b63b784b7 |
13 | 117983761c2a |
14 | 6d55b176b91 |
15 | 375163b69d7 |
hex | 1d47b2c63cb |
2012111201227 has 2 divisors, whose sum is σ = 2012111201228. Its totient is φ = 2012111201226.
The previous prime is 2012111201197. The next prime is 2012111201231. The reversal of 2012111201227 is 7221021112102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2012111201227 is a prime.
It is a super-2 number, since 2×20121112012272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2012111201198 and 2012111201207.
It is not a weakly prime, because it can be changed into another prime (2012111201257) 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 as a sum of consecutive naturals, namely, 1006055600613 + 1006055600614.
It is an arithmetic number, because the mean of its divisors is an integer number (1006055600614).
Almost surely, 22012111201227 is an apocalyptic number.
2012111201227 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012111201227 is an equidigital number, since it uses as much as digits as its factorization.
2012111201227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 2012111201227 its reverse (7221021112102), we get a palindrome (9233132313329).
The spelling of 2012111201227 in words is "two trillion, twelve billion, one hundred eleven million, two hundred one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •