Base | Representation |
---|---|
bin | 11110101101001101000… |
… | …001001111000111101001 |
3 | 21110201120222010221211022 |
4 | 132231031001033013221 |
5 | 234033012001041131 |
6 | 4253213134342225 |
7 | 305310524340605 |
oct | 36551501170751 |
9 | 7421528127738 |
10 | 2110121112041 |
11 | 7439963a2198 |
12 | 2a0b5735a975 |
13 | 123ca2b873b7 |
14 | 741b7b9c505 |
15 | 39d50a4a37b |
hex | 1eb4d04f1e9 |
2110121112041 has 2 divisors, whose sum is σ = 2110121112042. Its totient is φ = 2110121112040.
The previous prime is 2110121112007. The next prime is 2110121112053. The reversal of 2110121112041 is 1402111210112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2072531657641 + 37589454400 = 1439629^2 + 193880^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2110121112041 is a prime.
It is a super-2 number, since 2×21101211120412 (a number of 25 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 (2110121112091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055060556020 + 1055060556021.
It is an arithmetic number, because the mean of its divisors is an integer number (1055060556021).
Almost surely, 22110121112041 is an apocalyptic number.
It is an amenable number.
2110121112041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110121112041 is an equidigital number, since it uses as much as digits as its factorization.
2110121112041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 2110121112041 its reverse (1402111210112), we get a palindrome (3512232322153).
The spelling of 2110121112041 in words is "two trillion, one hundred ten billion, one hundred twenty-one million, one hundred twelve thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •