Base | Representation |
---|---|
bin | 11110110100111… |
… | …11000100000000 |
3 | 200000121022011211 |
4 | 33122133010000 |
5 | 1012200214331 |
6 | 41354415504 |
7 | 6260034256 |
oct | 1732370400 |
9 | 600538154 |
10 | 258601216 |
11 | 122a78a15 |
12 | 72731594 |
13 | 41764693 |
14 | 264b85d6 |
15 | 17a828b1 |
hex | f69f100 |
258601216 has 36 divisors (see below), whose sum is σ = 519137164. Its totient is φ = 128563200.
The previous prime is 258601201. The next prime is 258601223. The reversal of 258601216 is 612106852.
It can be written as a sum of positive squares in 2 ways, for example, as 30470400 + 228130816 = 5520^2 + 15104^2 .
It is a hoax number, since the sum of its digits (31) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43546 + ... + 49126.
Almost surely, 2258601216 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 258601216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (259568582).
258601216 is an abundant number, since it is smaller than the sum of its proper divisors (260535948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
258601216 is an equidigital number, since it uses as much as digits as its factorization.
258601216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5778 (or 5764 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 31.
The square root of 258601216 is about 16081.0825506245. The cubic root of 258601216 is about 637.1037884556.
The spelling of 258601216 in words is "two hundred fifty-eight million, six hundred one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •