Base | Representation |
---|---|
bin | 11110110111001… |
… | …00110001010100 |
3 | 200001010210211210 |
4 | 33123210301110 |
5 | 1012233333430 |
6 | 41404501420 |
7 | 6262333560 |
oct | 1733446124 |
9 | 601123753 |
10 | 258886740 |
11 | 123153492 |
12 | 7284a870 |
13 | 41834628 |
14 | 265506a0 |
15 | 17adc2b0 |
hex | f6e4c54 |
258886740 has 96 divisors (see below), whose sum is σ = 833624064. Its totient is φ = 58803840.
The previous prime is 258886739. The next prime is 258886757. The reversal of 258886740 is 47688852.
It is a self number, because there is not a number n which added to its sum of digits gives 258886740.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68295 + ... + 71985.
It is an arithmetic number, because the mean of its divisors is an integer number (8683584).
Almost surely, 2258886740 is an apocalyptic number.
258886740 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 258886740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (416812032).
258886740 is an abundant number, since it is smaller than the sum of its proper divisors (574737324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
258886740 is a wasteful number, since it uses less digits than its factorization.
258886740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3877 (or 3875 counting only the distinct ones).
The product of its (nonzero) digits is 860160, while the sum is 48.
The square root of 258886740 is about 16089.9577376698. The cubic root of 258886740 is about 637.3381796120.
The spelling of 258886740 in words is "two hundred fifty-eight million, eight hundred eighty-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •