Base | Representation |
---|---|
bin | 1001001100100110001000… |
… | …1011100110001110100101 |
3 | 1022210200211200102001010002 |
4 | 2103021202023212032211 |
5 | 2311133334024101432 |
6 | 33301215550311045 |
7 | 2062365535463153 |
oct | 223114213461645 |
9 | 38720750361102 |
10 | 10112000222117 |
11 | 3249525562662 |
12 | 11739344b8485 |
13 | 584732b798c1 |
14 | 26d5cdc283d3 |
15 | 128082943e62 |
hex | 932622e63a5 |
10112000222117 has 2 divisors, whose sum is σ = 10112000222118. Its totient is φ = 10112000222116.
The previous prime is 10112000222089. The next prime is 10112000222131. The reversal of 10112000222117 is 71122200021101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8451061799041 + 1660938423076 = 2907071^2 + 1288774^2 .
It is a cyclic number.
It is not a de Polignac number, because 10112000222117 - 222 = 10111996027813 is a prime.
It is a super-3 number, since 3×101120002221173 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10112000222417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056000111058 + 5056000111059.
It is an arithmetic number, because the mean of its divisors is an integer number (5056000111059).
Almost surely, 210112000222117 is an apocalyptic number.
It is an amenable number.
10112000222117 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112000222117 is an equidigital number, since it uses as much as digits as its factorization.
10112000222117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 10112000222117 its reverse (71122200021101), we get a palindrome (81234200243218).
The spelling of 10112000222117 in words is "ten trillion, one hundred twelve billion, two hundred twenty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •