Base | Representation |
---|---|
bin | 111110101011101… |
… | …1111111011111001 |
3 | 12102120202022210221 |
4 | 1331113133323321 |
5 | 13301421441441 |
6 | 544413140041 |
7 | 103056600211 |
oct | 17527377371 |
9 | 5376668727 |
10 | 2103312121 |
11 | 98a2a0589 |
12 | 4a848a621 |
13 | 2769aa5b1 |
14 | 15d4ad241 |
15 | c49bd8d1 |
hex | 7d5dfef9 |
2103312121 has 2 divisors, whose sum is σ = 2103312122. Its totient is φ = 2103312120.
The previous prime is 2103312089. The next prime is 2103312137. The reversal of 2103312121 is 1212133012.
It is an a-pointer prime, because the next prime (2103312137) can be obtained adding 2103312121 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2086205625 + 17106496 = 45675^2 + 4136^2 .
It is a cyclic number.
It is not a de Polignac number, because 2103312121 - 25 = 2103312089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2103312095 and 2103312104.
It is not a weakly prime, because it can be changed into another prime (2103372121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1051656060 + 1051656061.
It is an arithmetic number, because the mean of its divisors is an integer number (1051656061).
Almost surely, 22103312121 is an apocalyptic number.
It is an amenable number.
2103312121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2103312121 is an equidigital number, since it uses as much as digits as its factorization.
2103312121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 2103312121 is about 45861.8809143280. The cubic root of 2103312121 is about 1281.2520547070.
Adding to 2103312121 its reverse (1212133012), we get a palindrome (3315445133).
The spelling of 2103312121 in words is "two billion, one hundred three million, three hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •