Base | Representation |
---|---|
bin | 10001011101101100110… |
… | …110100010100010000011 |
3 | 11020201201120111001022222 |
4 | 101131230312202202003 |
5 | 124130322230042011 |
6 | 2315154541521255 |
7 | 152464100432045 |
oct | 21355466424203 |
9 | 4221646431288 |
10 | 1200122112131 |
11 | 422a72710808 |
12 | 17471257322b |
13 | 8922b9a10c7 |
14 | 4212c833a95 |
15 | 213407abddb |
hex | 1176cda2883 |
1200122112131 has 2 divisors, whose sum is σ = 1200122112132. Its totient is φ = 1200122112130.
The previous prime is 1200122112121. The next prime is 1200122112199. The reversal of 1200122112131 is 1312112210021.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1312112210021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1200122112131 - 26 = 1200122112067 is a prime.
It is a super-2 number, since 2×12001221121312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1200122112121) 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, 600061056065 + 600061056066.
It is an arithmetic number, because the mean of its divisors is an integer number (600061056066).
Almost surely, 21200122112131 is an apocalyptic number.
1200122112131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200122112131 is an equidigital number, since it uses as much as digits as its factorization.
1200122112131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1200122112131 its reverse (1312112210021), we get a palindrome (2512234322152).
The spelling of 1200122112131 in words is "one trillion, two hundred billion, one hundred twenty-two million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •