Base | Representation |
---|---|
bin | 100101001010110010110… |
… | …011000100010110010111 |
3 | 100001011212022022102002122 |
4 | 211022302303010112113 |
5 | 313322010314233211 |
6 | 5233215451130155 |
7 | 352351466242211 |
oct | 45126263042627 |
9 | 10034768272078 |
10 | 2554210305431 |
11 | 8a52641470a4 |
12 | 353033a4395b |
13 | 156b267c8445 |
14 | 8b8a565d5b1 |
15 | 46692e1d6db |
hex | 252b2cc4597 |
2554210305431 has 2 divisors, whose sum is σ = 2554210305432. Its totient is φ = 2554210305430.
The previous prime is 2554210305419. The next prime is 2554210305433. The reversal of 2554210305431 is 1345030124552.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2554210305431 is a prime.
It is a super-2 number, since 2×25542103054312 (a number of 26 digits) contains 22 as substring.
Together with 2554210305433, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2554210305391 and 2554210305400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2554210305433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1277105152715 + 1277105152716.
It is an arithmetic number, because the mean of its divisors is an integer number (1277105152716).
Almost surely, 22554210305431 is an apocalyptic number.
2554210305431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2554210305431 is an equidigital number, since it uses as much as digits as its factorization.
2554210305431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 2554210305431 its reverse (1345030124552), we get a palindrome (3899240429983).
The spelling of 2554210305431 in words is "two trillion, five hundred fifty-four billion, two hundred ten million, three hundred five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •