Base | Representation |
---|---|
bin | 11110101111000100001… |
… | …110001101010000000001 |
3 | 21110220202100021211200022 |
4 | 132233010032031100001 |
5 | 234101110434012321 |
6 | 4254143415103225 |
7 | 305411220200546 |
oct | 36570416152001 |
9 | 7426670254608 |
10 | 2112121000961 |
11 | 744822273354 |
12 | 2a1415071b15 |
13 | 1242312c301a |
14 | 74327628bcd |
15 | 39e1b3d9dab |
hex | 1ebc438d401 |
2112121000961 has 2 divisors, whose sum is σ = 2112121000962. Its totient is φ = 2112121000960.
The previous prime is 2112121000943. The next prime is 2112121000999. The reversal of 2112121000961 is 1690001212112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1704445135936 + 407675865025 = 1305544^2 + 638495^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2112121000961 is a prime.
It is a super-3 number, since 3×21121210009613 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 2112121000961.
It is not a weakly prime, because it can be changed into another prime (2112121000931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056060500480 + 1056060500481.
It is an arithmetic number, because the mean of its divisors is an integer number (1056060500481).
Almost surely, 22112121000961 is an apocalyptic number.
It is an amenable number.
2112121000961 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112121000961 is an equidigital number, since it uses as much as digits as its factorization.
2112121000961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 26.
The spelling of 2112121000961 in words is "two trillion, one hundred twelve billion, one hundred twenty-one million, nine hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •