Base | Representation |
---|---|
bin | 1001011111111110… |
… | …0101000010111111 |
3 | 20120201022202122101 |
4 | 2113333211002333 |
5 | 20210301321211 |
6 | 1101011525531 |
7 | 120122603251 |
oct | 22777450277 |
9 | 6521282571 |
10 | 2550026431 |
11 | 1099472667 |
12 | 5b1bb98a7 |
13 | 3183c68a4 |
14 | 1a2953cd1 |
15 | edd0d5c1 |
hex | 97fe50bf |
2550026431 has 2 divisors, whose sum is σ = 2550026432. Its totient is φ = 2550026430.
The previous prime is 2550026411. The next prime is 2550026459. The reversal of 2550026431 is 1346200552.
It is an a-pointer prime, because the next prime (2550026459) can be obtained adding 2550026431 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2550026431 - 213 = 2550018239 is a prime.
It is a super-2 number, since 2×25500264312 = 13005269597597195522, 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 2550026431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2550026411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1275013215 + 1275013216.
It is an arithmetic number, because the mean of its divisors is an integer number (1275013216).
Almost surely, 22550026431 is an apocalyptic number.
2550026431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2550026431 is an equidigital number, since it uses as much as digits as its factorization.
2550026431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 2550026431 is about 50497.7863970293. The cubic root of 2550026431 is about 1366.2019282869.
Adding to 2550026431 its reverse (1346200552), we get a palindrome (3896226983).
The spelling of 2550026431 in words is "two billion, five hundred fifty million, twenty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •