Base | Representation |
---|---|
bin | 1001011000110110… |
… | …1000010100100111 |
3 | 20111122010011100001 |
4 | 2112031220110213 |
5 | 20130124433211 |
6 | 1054023402131 |
7 | 116310652633 |
oct | 22615502447 |
9 | 6448104301 |
10 | 2520155431 |
11 | 1083620092 |
12 | 5a3bb3347 |
13 | 312168541 |
14 | 19c9b9dc3 |
15 | eb3acac1 |
hex | 96368527 |
2520155431 has 2 divisors, whose sum is σ = 2520155432. Its totient is φ = 2520155430.
The previous prime is 2520155413. The next prime is 2520155461. The reversal of 2520155431 is 1345510252.
Together with previous prime (2520155413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2520155431 - 213 = 2520147239 is a prime.
It is a super-2 number, since 2×25201554312 = 12702366792797591522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2520155431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2520155401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1260077715 + 1260077716.
It is an arithmetic number, because the mean of its divisors is an integer number (1260077716).
Almost surely, 22520155431 is an apocalyptic number.
2520155431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2520155431 is an equidigital number, since it uses as much as digits as its factorization.
2520155431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 2520155431 is about 50201.1496979900. The cubic root of 2520155431 is about 1360.8464005743.
Adding to 2520155431 its reverse (1345510252), we get a palindrome (3865665683).
The spelling of 2520155431 in words is "two billion, five hundred twenty million, one hundred fifty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •