Base | Representation |
---|---|
bin | 100000111001010110100… |
… | …110001101000011101111 |
3 | 22000010000111100201020212 |
4 | 200321112212031003233 |
5 | 244014210021400411 |
6 | 4450301412333035 |
7 | 322215626002442 |
oct | 40712646150357 |
9 | 8003014321225 |
10 | 2260605653231 |
11 | 7a1798a59302 |
12 | 30615431417b |
13 | 135235938503 |
14 | 7b5b1a3d659 |
15 | 3dc0be3c68b |
hex | 20e5698d0ef |
2260605653231 has 2 divisors, whose sum is σ = 2260605653232. Its totient is φ = 2260605653230.
The previous prime is 2260605653213. The next prime is 2260605653239. The reversal of 2260605653231 is 1323565060622.
2260605653231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (2260605653213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2260605653231 is a prime.
It is a super-2 number, since 2×22606056532312 (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 (2260605653239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1130302826615 + 1130302826616.
It is an arithmetic number, because the mean of its divisors is an integer number (1130302826616).
Almost surely, 22260605653231 is an apocalyptic number.
2260605653231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2260605653231 is an equidigital number, since it uses as much as digits as its factorization.
2260605653231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 41.
The spelling of 2260605653231 in words is "two trillion, two hundred sixty billion, six hundred five million, six hundred fifty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •