Base | Representation |
---|---|
bin | 11110110000110… |
… | …00000000000000 |
3 | 122222120012022100 |
4 | 33120120000000 |
5 | 1012030014000 |
6 | 41334510400 |
7 | 6252241350 |
oct | 1730300000 |
9 | 588505270 |
10 | 258048000 |
11 | 122730311 |
12 | 72505400 |
13 | 415cc932 |
14 | 263b2b60 |
15 | 179c3a00 |
hex | f618000 |
258048000 has 384 divisors, whose sum is σ = 1063239840. Its totient is φ = 58982400.
The previous prime is 258047989. The next prime is 258048013. The reversal of 258048000 is 840852.
258048000 is a `hidden beast` number, since 2 + 580 + 4 + 80 + 0 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (384).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36863997 + ... + 36864003.
Almost surely, 2258048000 is an apocalyptic number.
258048000 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 258048000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (531619920).
258048000 is an abundant number, since it is smaller than the sum of its proper divisors (805191840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
258048000 is an frugal number, since it uses more digits than its factorization.
258048000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58 (or 17 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 27.
The square root of 258048000 is about 16063.8725094543. The cubic root of 258048000 is about 636.6491532634.
Adding to 258048000 its reverse (840852), we get a palindrome (258888852).
The spelling of 258048000 in words is "two hundred fifty-eight million, forty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •