Base | Representation |
---|---|
bin | 11101111011111… |
… | …11001000111001 |
3 | 122111112202011212 |
4 | 32331333020321 |
5 | 1003242133200 |
6 | 40530332505 |
7 | 6136400450 |
oct | 1675771071 |
9 | 574482155 |
10 | 251130425 |
11 | 119836007 |
12 | 7012a135 |
13 | 4004a0b0 |
14 | 254d1b97 |
15 | 170a9035 |
hex | ef7f239 |
251130425 has 48 divisors (see below), whose sum is σ = 386141952. Its totient is φ = 157766400.
The previous prime is 251130421. The next prime is 251130427. The reversal of 251130425 is 524031152.
It is not a de Polignac number, because 251130425 - 22 = 251130421 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 251130425.
It is not an unprimeable number, because it can be changed into a prime (251130421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 379595 + ... + 380255.
It is an arithmetic number, because the mean of its divisors is an integer number (8044624).
Almost surely, 2251130425 is an apocalyptic number.
251130425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
251130425 is a deficient number, since it is larger than the sum of its proper divisors (135011527).
251130425 is a wasteful number, since it uses less digits than its factorization.
251130425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 858 (or 853 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 251130425 is about 15847.0951596815. The cubic root of 251130425 is about 630.9085949193.
Adding to 251130425 its reverse (524031152), we get a palindrome (775161577).
The spelling of 251130425 in words is "two hundred fifty-one million, one hundred thirty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •