Base | Representation |
---|---|
bin | 11001011101111111100000… |
… | …101001101000011010110111 |
3 | 112200121021010021120222002212 |
4 | 121131333200221220122313 |
5 | 104140202012101402411 |
6 | 1034121412021524035 |
7 | 32410421155040603 |
oct | 3135774051503267 |
9 | 480537107528085 |
10 | 112012221122231 |
11 | 32766130741aa1 |
12 | 1069087627361b |
13 | 4a6692673b7b1 |
14 | 1d935c592c503 |
15 | ce3a6558d68b |
hex | 65dfe0a686b7 |
112012221122231 has 2 divisors, whose sum is σ = 112012221122232. Its totient is φ = 112012221122230.
The previous prime is 112012221122189. The next prime is 112012221122251. The reversal of 112012221122231 is 132221122210211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112012221122231 - 246 = 41643476944567 is a prime.
It is a super-2 number, since 2×1120122211222312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112012221122197 and 112012221122206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112012221122251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56006110561115 + 56006110561116.
It is an arithmetic number, because the mean of its divisors is an integer number (56006110561116).
Almost surely, 2112012221122231 is an apocalyptic number.
112012221122231 is a deficient number, since it is larger than the sum of its proper divisors (1).
112012221122231 is an equidigital number, since it uses as much as digits as its factorization.
112012221122231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 112012221122231 its reverse (132221122210211), we get a palindrome (244233343332442).
The spelling of 112012221122231 in words is "one hundred twelve trillion, twelve billion, two hundred twenty-one million, one hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •