Base | Representation |
---|---|
bin | 11110101111000110111… |
… | …010101010111100000101 |
3 | 21110220212111100202122112 |
4 | 132233012322222330011 |
5 | 234101204022230313 |
6 | 4254152112110405 |
7 | 305412306366323 |
oct | 36570672527405 |
9 | 7426774322575 |
10 | 2112166211333 |
11 | 7448458425a2 |
12 | 2a1428235405 |
13 | 12423a792319 |
14 | 7432d636d13 |
15 | 39e2036a8a8 |
hex | 1ebc6eaaf05 |
2112166211333 has 2 divisors, whose sum is σ = 2112166211334. Its totient is φ = 2112166211332.
The previous prime is 2112166211327. The next prime is 2112166211387. The reversal of 2112166211333 is 3331126612112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1926940988449 + 185225222884 = 1388143^2 + 430378^2 .
It is a cyclic number.
It is not a de Polignac number, because 2112166211333 - 240 = 1012654583557 is a prime.
It is a super-2 number, since 2×21121662113332 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2112166211333.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2112166211833) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056083105666 + 1056083105667.
It is an arithmetic number, because the mean of its divisors is an integer number (1056083105667).
Almost surely, 22112166211333 is an apocalyptic number.
It is an amenable number.
2112166211333 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112166211333 is an equidigital number, since it uses as much as digits as its factorization.
2112166211333 is an evil number, because the sum of its binary digits is even.
The product of its digits is 7776, while the sum is 32.
The spelling of 2112166211333 in words is "two trillion, one hundred twelve billion, one hundred sixty-six million, two hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •