Base | Representation |
---|---|
bin | 11001011101111101011110… |
… | …000011001111111010100111 |
3 | 112200121001110120122120001222 |
4 | 121131331132003033322213 |
5 | 104140133020141203221 |
6 | 1034120410351010555 |
7 | 32410312651020311 |
oct | 3135753603177247 |
9 | 480531416576058 |
10 | 112010030022311 |
11 | 32765206941213 |
12 | 10690364509a5b |
13 | 4a66667805175 |
14 | 1d9345892a7b1 |
15 | ce398802d9ab |
hex | 65df5e0cfea7 |
112010030022311 has 2 divisors, whose sum is σ = 112010030022312. Its totient is φ = 112010030022310.
The previous prime is 112010030022271. The next prime is 112010030022313. The reversal of 112010030022311 is 113220030010211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112010030022311 - 210 = 112010030021287 is a prime.
It is a Sophie Germain prime.
Together with 112010030022313, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112010030022311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112010030022313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56005015011155 + 56005015011156.
It is an arithmetic number, because the mean of its divisors is an integer number (56005015011156).
Almost surely, 2112010030022311 is an apocalyptic number.
112010030022311 is a deficient number, since it is larger than the sum of its proper divisors (1).
112010030022311 is an equidigital number, since it uses as much as digits as its factorization.
112010030022311 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 112010030022311 its reverse (113220030010211), we get a palindrome (225230060032522).
The spelling of 112010030022311 in words is "one hundred twelve trillion, ten billion, thirty million, twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •