Base | Representation |
---|---|
bin | 11001011110000110111100… |
… | …010011010100111010111011 |
3 | 112200122000201102120110000021 |
4 | 121132012330103110322323 |
5 | 104140314333003330021 |
6 | 1034125211531151311 |
7 | 32411123004611134 |
oct | 3136067423247273 |
9 | 480560642513007 |
10 | 112020201230011 |
11 | 32769556263098 |
12 | 106923228a5537 |
13 | 4a675c8b08569 |
14 | 1d93b416d8c8b |
15 | ce3d80e59c41 |
hex | 65e1bc4d4ebb |
112020201230011 has 2 divisors, whose sum is σ = 112020201230012. Its totient is φ = 112020201230010.
The previous prime is 112020201229973. The next prime is 112020201230027. The reversal of 112020201230011 is 110032102020211.
It is an a-pointer prime, because the next prime (112020201230027) can be obtained adding 112020201230011 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112020201230011 - 29 = 112020201229499 is a prime.
It is a super-2 number, since 2×1120202012300112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112020201230081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56010100615005 + 56010100615006.
It is an arithmetic number, because the mean of its divisors is an integer number (56010100615006).
Almost surely, 2112020201230011 is an apocalyptic number.
112020201230011 is a deficient number, since it is larger than the sum of its proper divisors (1).
112020201230011 is an equidigital number, since it uses as much as digits as its factorization.
112020201230011 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 16.
Adding to 112020201230011 its reverse (110032102020211), we get a palindrome (222052303250222).
The spelling of 112020201230011 in words is "one hundred twelve trillion, twenty billion, two hundred one million, two hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •