Base | Representation |
---|---|
bin | 1001100000001111… |
… | …0111101101000001 |
3 | 20120210102220211211 |
4 | 2120003313231001 |
5 | 20211043321200 |
6 | 1101052010121 |
7 | 120135300154 |
oct | 23003675501 |
9 | 6523386754 |
10 | 2551151425 |
11 | 109a070909 |
12 | 5b2460941 |
13 | 3186cb974 |
14 | 1a2b67c9b |
15 | ede81aba |
hex | 980f7b41 |
2551151425 has 12 divisors (see below), whose sum is σ = 3194751996. Its totient is φ = 2020712000.
The previous prime is 2551151423. The next prime is 2551151521. The reversal of 2551151425 is 5241511552.
It can be written as a sum of positive squares in 6 ways, for example, as 52751169 + 2498400256 = 7263^2 + 49984^2 .
It is not a de Polignac number, because 2551151425 - 21 = 2551151423 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2551151423) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 502654 + ... + 507703.
It is an arithmetic number, because the mean of its divisors is an integer number (266229333).
Almost surely, 22551151425 is an apocalyptic number.
2551151425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2551151425 is a deficient number, since it is larger than the sum of its proper divisors (643600571).
2551151425 is a wasteful number, since it uses less digits than its factorization.
2551151425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010468 (or 1010463 counting only the distinct ones).
The product of its digits is 10000, while the sum is 31.
The square root of 2551151425 is about 50508.9242114698. The cubic root of 2551151425 is about 1366.4028076435.
Adding to 2551151425 its reverse (5241511552), we get a palindrome (7792662977).
The spelling of 2551151425 in words is "two billion, five hundred fifty-one million, one hundred fifty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •