Base | Representation |
---|---|
bin | 1011100111000001010101… |
… | …11111100001011010011111 |
3 | 10100101122102002001221001011 |
4 | 11303200222333201122133 |
5 | 11321240423231334211 |
6 | 130144153454000051 |
7 | 5243324241101113 |
oct | 563405277413237 |
9 | 110348362057034 |
10 | 25530006902431 |
11 | 815324036aa09 |
12 | 2a43a777a6027 |
13 | 1132614136825 |
14 | 64393214b743 |
15 | 2e4162729921 |
hex | 17382afe169f |
25530006902431 has 2 divisors, whose sum is σ = 25530006902432. Its totient is φ = 25530006902430.
The previous prime is 25530006902341. The next prime is 25530006902437. The reversal of 25530006902431 is 13420960003552.
Together with previous prime (25530006902341) 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 not a de Polignac number, because 25530006902431 - 227 = 25529872684703 is a prime.
It is a super-2 number, since 2×255300069024312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (25530006902437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12765003451215 + 12765003451216.
It is an arithmetic number, because the mean of its divisors is an integer number (12765003451216).
Almost surely, 225530006902431 is an apocalyptic number.
25530006902431 is a deficient number, since it is larger than the sum of its proper divisors (1).
25530006902431 is an equidigital number, since it uses as much as digits as its factorization.
25530006902431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 194400, while the sum is 40.
Adding to 25530006902431 its reverse (13420960003552), we get a palindrome (38950966905983).
The spelling of 25530006902431 in words is "twenty-five trillion, five hundred thirty billion, six million, nine hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •