Base | Representation |
---|---|
bin | 11110110100001… |
… | …00101110111000 |
3 | 200000101211020110 |
4 | 33122010232320 |
5 | 1012133241433 |
6 | 41352224320 |
7 | 6256104660 |
oct | 1732045670 |
9 | 600354213 |
10 | 258493368 |
11 | 122a04991 |
12 | 7269b0a0 |
13 | 41727573 |
14 | 2648b1a0 |
15 | 17a60963 |
hex | f684bb8 |
258493368 has 64 divisors (see below), whose sum is σ = 741888000. Its totient is φ = 73521792.
The previous prime is 258493331. The next prime is 258493379. The reversal of 258493368 is 863394852.
It is a hoax number, since the sum of its digits (48) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35113 + ... + 41831.
It is an arithmetic number, because the mean of its divisors is an integer number (11592000).
Almost surely, 2258493368 is an apocalyptic number.
258493368 is a gapful number since it is divisible by the number (28) 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 258493368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (370944000).
258493368 is an abundant number, since it is smaller than the sum of its proper divisors (483394632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
258493368 is a wasteful number, since it uses less digits than its factorization.
258493368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6964 (or 6960 counting only the distinct ones).
The product of its digits is 1244160, while the sum is 48.
The square root of 258493368 is about 16077.7289441015. The cubic root of 258493368 is about 637.0152094401.
The spelling of 258493368 in words is "two hundred fifty-eight million, four hundred ninety-three thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •