Base | Representation |
---|---|
bin | 1001100010011101… |
… | …0100101100101111 |
3 | 20121102221002112212 |
4 | 2120213110230233 |
5 | 20220433221411 |
6 | 1102023121035 |
7 | 120310265621 |
oct | 23047245457 |
9 | 6542832485 |
10 | 2560445231 |
11 | 10a4339443 |
12 | 5b55a317b |
13 | 31a603c66 |
14 | 1a40a6c11 |
15 | eebba68b |
hex | 989d4b2f |
2560445231 has 2 divisors, whose sum is σ = 2560445232. Its totient is φ = 2560445230.
The previous prime is 2560445161. The next prime is 2560445233. The reversal of 2560445231 is 1325440652.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2560445231 is a prime.
It is a super-2 number, since 2×25604452312 = 13111759561901286722, which contains 22 as substring.
Together with 2560445233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2560445233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1280222615 + 1280222616.
It is an arithmetic number, because the mean of its divisors is an integer number (1280222616).
Almost surely, 22560445231 is an apocalyptic number.
2560445231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2560445231 is an equidigital number, since it uses as much as digits as its factorization.
2560445231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 32.
The square root of 2560445231 is about 50600.8421965485. The cubic root of 2560445231 is about 1368.0600584006.
Adding to 2560445231 its reverse (1325440652), we get a palindrome (3885885883).
The spelling of 2560445231 in words is "two billion, five hundred sixty million, four hundred forty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •