Base | Representation |
---|---|
bin | 11101111111001… |
… | …10111001100110 |
3 | 122112100100011210 |
4 | 32333212321212 |
5 | 1003344233210 |
6 | 40543412250 |
7 | 6143120520 |
oct | 1677467146 |
9 | 575310153 |
10 | 251555430 |
11 | 119aa6355 |
12 | 702b4086 |
13 | 40168689 |
14 | 255a2a10 |
15 | 1713ee20 |
hex | efe6e66 |
251555430 has 64 divisors (see below), whose sum is σ = 694637568. Its totient is φ = 57110400.
The previous prime is 251555419. The next prime is 251555431. The reversal of 251555430 is 34555152.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (251555431) 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 31 ways as a sum of consecutive naturals, for example, 27744 + ... + 35676.
It is an arithmetic number, because the mean of its divisors is an integer number (10853712).
Almost surely, 2251555430 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 251555430, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (347318784).
251555430 is an abundant number, since it is smaller than the sum of its proper divisors (443082138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
251555430 is a wasteful number, since it uses less digits than its factorization.
251555430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8101.
The product of its (nonzero) digits is 15000, while the sum is 30.
The square root of 251555430 is about 15860.4990463730. The cubic root of 251555430 is about 631.2643040905.
The spelling of 251555430 in words is "two hundred fifty-one million, five hundred fifty-five thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •