Base | Representation |
---|---|
bin | 11001100010010111101111… |
… | …101000001000111010000001 |
3 | 112201200000210110002210110202 |
4 | 121202113233220020322001 |
5 | 104210114232221144334 |
6 | 1034511533551134545 |
7 | 32441232550123505 |
oct | 3142275750107201 |
9 | 481600713083422 |
10 | 112313120099969 |
11 | 328717aa3325a8 |
12 | 1071b050814455 |
13 | 4a8910a896699 |
14 | 1da3dac202305 |
15 | ceb7c6b2617e |
hex | 6625efa08e81 |
112313120099969 has 2 divisors, whose sum is σ = 112313120099970. Its totient is φ = 112313120099968.
The previous prime is 112313120099927. The next prime is 112313120100029. The reversal of 112313120099969 is 969990021313211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112311499634944 + 1620465025 = 10597712^2 + 40255^2 .
It is a cyclic number.
It is not a de Polignac number, because 112313120099969 - 236 = 112244400623233 is a prime.
It is a super-2 number, since 2×1123131200999692 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (112313120099909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56156560049984 + 56156560049985.
It is an arithmetic number, because the mean of its divisors is an integer number (56156560049985).
Almost surely, 2112313120099969 is an apocalyptic number.
It is an amenable number.
112313120099969 is a deficient number, since it is larger than the sum of its proper divisors (1).
112313120099969 is an equidigital number, since it uses as much as digits as its factorization.
112313120099969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1417176, while the sum is 56.
The spelling of 112313120099969 in words is "one hundred twelve trillion, three hundred thirteen billion, one hundred twenty million, ninety-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •