Base | Representation |
---|---|
bin | 1001011011011111… |
… | …1101000010001001 |
3 | 20112101222211122121 |
4 | 2112313331002021 |
5 | 20141000002223 |
6 | 1055101251241 |
7 | 116504162344 |
oct | 22667750211 |
9 | 6471884577 |
10 | 2531250313 |
11 | 1089908909 |
12 | 5a7863b21 |
13 | 314551567 |
14 | 1a026745b |
15 | ec35015d |
hex | 96dfd089 |
2531250313 has 2 divisors, whose sum is σ = 2531250314. Its totient is φ = 2531250312.
The previous prime is 2531250307. The next prime is 2531250329. The reversal of 2531250313 is 3130521352.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1502957824 + 1028292489 = 38768^2 + 32067^2 .
It is a cyclic number.
It is not a de Polignac number, because 2531250313 - 221 = 2529153161 is a prime.
It is not a weakly prime, because it can be changed into another prime (2531250913) 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, 1265625156 + 1265625157.
It is an arithmetic number, because the mean of its divisors is an integer number (1265625157).
Almost surely, 22531250313 is an apocalyptic number.
It is an amenable number.
2531250313 is a deficient number, since it is larger than the sum of its proper divisors (1).
2531250313 is an equidigital number, since it uses as much as digits as its factorization.
2531250313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 2531250313 is about 50311.5326043642. The cubic root of 2531250313 is about 1362.8405007978.
Adding to 2531250313 its reverse (3130521352), we get a palindrome (5661771665).
It can be divided in two parts, 25312 and 50313, that added together give a square (75625 = 2752).
The spelling of 2531250313 in words is "two billion, five hundred thirty-one million, two hundred fifty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •