Base | Representation |
---|---|
bin | 111110101011110… |
… | …0000001101000001 |
3 | 12102120202101022112 |
4 | 1331113200031001 |
5 | 13301422010332 |
6 | 544413145105 |
7 | 103056603335 |
oct | 17527401501 |
9 | 5376671275 |
10 | 2103313217 |
11 | 98a2a1395 |
12 | 4a848b195 |
13 | 2769aac45 |
14 | 15d4ad7c5 |
15 | c49bddb2 |
hex | 7d5e0341 |
2103313217 has 2 divisors, whose sum is σ = 2103313218. Its totient is φ = 2103313216.
The previous prime is 2103313213. The next prime is 2103313271. The reversal of 2103313217 is 7123133012.
Together with next prime (2103313271) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1975713601 + 127599616 = 44449^2 + 11296^2 .
It is a cyclic number.
It is not a de Polignac number, because 2103313217 - 22 = 2103313213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2103313192 and 2103313201.
It is not a weakly prime, because it can be changed into another prime (2103313213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1051656608 + 1051656609.
It is an arithmetic number, because the mean of its divisors is an integer number (1051656609).
Almost surely, 22103313217 is an apocalyptic number.
It is an amenable number.
2103313217 is a deficient number, since it is larger than the sum of its proper divisors (1).
2103313217 is an equidigital number, since it uses as much as digits as its factorization.
2103313217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 23.
The square root of 2103313217 is about 45861.8928632476. The cubic root of 2103313217 is about 1281.2522772531.
Adding to 2103313217 its reverse (7123133012), we get a palindrome (9226446229).
The spelling of 2103313217 in words is "two billion, one hundred three million, three hundred thirteen thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •