Base | Representation |
---|---|
bin | 100000111001010110100… |
… | …110001101000011011101 |
3 | 22000010000111100201020012 |
4 | 200321112212031003131 |
5 | 244014210021400323 |
6 | 4450301412333005 |
7 | 322215626002415 |
oct | 40712646150335 |
9 | 8003014321205 |
10 | 2260605653213 |
11 | 7a1798a59296 |
12 | 306154314165 |
13 | 1352359384bb |
14 | 7b5b1a3d645 |
15 | 3dc0be3c678 |
hex | 20e5698d0dd |
2260605653213 has 2 divisors, whose sum is σ = 2260605653214. Its totient is φ = 2260605653212.
The previous prime is 2260605653171. The next prime is 2260605653231. The reversal of 2260605653213 is 3123565060622.
Together with next prime (2260605653231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2153975975449 + 106629677764 = 1467643^2 + 326542^2 .
It is a cyclic number.
It is not a de Polignac number, because 2260605653213 - 26 = 2260605653149 is a prime.
It is a super-2 number, since 2×22606056532132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2290605653213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1130302826606 + 1130302826607.
It is an arithmetic number, because the mean of its divisors is an integer number (1130302826607).
Almost surely, 22260605653213 is an apocalyptic number.
It is an amenable number.
2260605653213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2260605653213 is an equidigital number, since it uses as much as digits as its factorization.
2260605653213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 388800, while the sum is 41.
The spelling of 2260605653213 in words is "two trillion, two hundred sixty billion, six hundred five million, six hundred fifty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •