Base | Representation |
---|---|
bin | 1001010100000100… |
… | …0011011111001101 |
3 | 20110020100022020022 |
4 | 2111001003133031 |
5 | 20110010102423 |
6 | 1052025231525 |
7 | 115645225451 |
oct | 22501033715 |
9 | 6406308208 |
10 | 2500081613 |
11 | 107325a357 |
12 | 5993325a5 |
13 | 30ac5a643 |
14 | 19a072661 |
15 | e9744dc8 |
hex | 950437cd |
2500081613 has 2 divisors, whose sum is σ = 2500081614. Its totient is φ = 2500081612.
The previous prime is 2500081513. The next prime is 2500081631. The reversal of 2500081613 is 3161800052.
Together with next prime (2500081631) 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., 2190427204 + 309654409 = 46802^2 + 17597^2 .
It is a cyclic number.
It is not a de Polignac number, because 2500081613 - 28 = 2500081357 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2500081673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1250040806 + 1250040807.
It is an arithmetic number, because the mean of its divisors is an integer number (1250040807).
Almost surely, 22500081613 is an apocalyptic number.
It is an amenable number.
2500081613 is a deficient number, since it is larger than the sum of its proper divisors (1).
2500081613 is an equidigital number, since it uses as much as digits as its factorization.
2500081613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 2500081613 is about 50000.8161233394. The cubic root of 2500081613 is about 1357.2235769211.
Adding to 2500081613 its reverse (3161800052), we get a palindrome (5661881665).
The spelling of 2500081613 in words is "two billion, five hundred million, eighty-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •