Base | Representation |
---|---|
bin | 11001011101111101100011… |
… | …001000001110001010111001 |
3 | 112200121001200111221122022012 |
4 | 121131331203020032022321 |
5 | 104140133203443240321 |
6 | 1034120423032535305 |
7 | 32410315034066531 |
oct | 3135754310161271 |
9 | 480531614848265 |
10 | 112010115211961 |
11 | 3276524aa3748a |
12 | 10690388b51535 |
13 | 4a6667c361745 |
14 | 1d93465d844c1 |
15 | ce399075a05b |
hex | 65df6320e2b9 |
112010115211961 has 2 divisors, whose sum is σ = 112010115211962. Its totient is φ = 112010115211960.
The previous prime is 112010115211861. The next prime is 112010115212041. The reversal of 112010115211961 is 169112511010211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110945774286400 + 1064340925561 = 10533080^2 + 1031669^2 .
It is a cyclic number.
It is not a de Polignac number, because 112010115211961 - 222 = 112010111017657 is a prime.
It is not a weakly prime, because it can be changed into another prime (112010115211661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56005057605980 + 56005057605981.
It is an arithmetic number, because the mean of its divisors is an integer number (56005057605981).
Almost surely, 2112010115211961 is an apocalyptic number.
It is an amenable number.
112010115211961 is a deficient number, since it is larger than the sum of its proper divisors (1).
112010115211961 is an equidigital number, since it uses as much as digits as its factorization.
112010115211961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 32.
The spelling of 112010115211961 in words is "one hundred twelve trillion, ten billion, one hundred fifteen million, two hundred eleven thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •