Base | Representation |
---|---|
bin | 1001100000011010… |
… | …1110110100000001 |
3 | 20120211212000200012 |
4 | 2120012232310001 |
5 | 20211241321231 |
6 | 1101120034305 |
7 | 120144542615 |
oct | 23006566401 |
9 | 6524760605 |
10 | 2551901441 |
11 | 109a533361 |
12 | 5b2762995 |
13 | 31890216b |
14 | 1a2cc1345 |
15 | ee07de2b |
hex | 981aed01 |
2551901441 has 2 divisors, whose sum is σ = 2551901442. Its totient is φ = 2551901440.
The previous prime is 2551901437. The next prime is 2551901461. The reversal of 2551901441 is 1441091552.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2547321841 + 4579600 = 50471^2 + 2140^2 .
It is a cyclic number.
It is not a de Polignac number, because 2551901441 - 22 = 2551901437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2551901398 and 2551901407.
It is not a weakly prime, because it can be changed into another prime (2551901461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1275950720 + 1275950721.
It is an arithmetic number, because the mean of its divisors is an integer number (1275950721).
Almost surely, 22551901441 is an apocalyptic number.
It is an amenable number.
2551901441 is a deficient number, since it is larger than the sum of its proper divisors (1).
2551901441 is an equidigital number, since it uses as much as digits as its factorization.
2551901441 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 32.
The square root of 2551901441 is about 50516.3482547977. The cubic root of 2551901441 is about 1366.5366979783.
Adding to 2551901441 its reverse (1441091552), we get a palindrome (3992992993).
The spelling of 2551901441 in words is "two billion, five hundred fifty-one million, nine hundred one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •