Base | Representation |
---|---|
bin | 11110110110101… |
… | …11000100110000 |
3 | 200001000221220000 |
4 | 33123113010300 |
5 | 1012230040030 |
6 | 41403350000 |
7 | 6262011165 |
oct | 1733270460 |
9 | 601027800 |
10 | 258830640 |
11 | 123115322 |
12 | 72822300 |
13 | 41814c33 |
14 | 2653806c |
15 | 17aca860 |
hex | f6d7130 |
258830640 has 200 divisors, whose sum is σ = 915544080. Its totient is φ = 67751424.
The previous prime is 258830609. The next prime is 258830669. The reversal of 258830640 is 46038852.
258830640 is a `hidden beast` number, since 2 + 5 + 8 + 8 + 3 + 0 + 640 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 258830595 and 258830604.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 381982 + ... + 382658.
Almost surely, 2258830640 is an apocalyptic number.
258830640 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 258830640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (457772040).
258830640 is an abundant number, since it is smaller than the sum of its proper divisors (656713440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
258830640 is a wasteful number, since it uses less digits than its factorization.
258830640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 761 (or 746 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 36.
The square root of 258830640 is about 16088.2143198057. The cubic root of 258830640 is about 637.2921398460.
The spelling of 258830640 in words is "two hundred fifty-eight million, eight hundred thirty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •