Base | Representation |
---|---|
bin | 11001011101111111100000… |
… | …101001111110011001000111 |
3 | 112200121021010021202112120012 |
4 | 121131333200221332121013 |
5 | 104140202012112242411 |
6 | 1034121412023500435 |
7 | 32410421155564154 |
oct | 3135774051763107 |
9 | 480537107675505 |
10 | 112012221212231 |
11 | 327661307a367a |
12 | 106908762b771b |
13 | 4a66926770752 |
14 | 1d935c595322b |
15 | ce3a655aa18b |
hex | 65dfe0a7e647 |
112012221212231 has 2 divisors, whose sum is σ = 112012221212232. Its totient is φ = 112012221212230.
The previous prime is 112012221212173. The next prime is 112012221212263. The reversal of 112012221212231 is 132212122210211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112012221212231 - 210 = 112012221211207 is a prime.
It is a super-2 number, since 2×1120122212122312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112012221212197 and 112012221212206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112012221212831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56006110606115 + 56006110606116.
It is an arithmetic number, because the mean of its divisors is an integer number (56006110606116).
Almost surely, 2112012221212231 is an apocalyptic number.
112012221212231 is a deficient number, since it is larger than the sum of its proper divisors (1).
112012221212231 is an equidigital number, since it uses as much as digits as its factorization.
112012221212231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 112012221212231 its reverse (132212122210211), we get a palindrome (244224343422442).
The spelling of 112012221212231 in words is "one hundred twelve trillion, twelve billion, two hundred twenty-one million, two hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •