Base | Representation |
---|---|
bin | 11110110010000… |
… | …00000011010100 |
3 | 122222212112100100 |
4 | 33121000003110 |
5 | 1012100241202 |
6 | 41342214100 |
7 | 6253523550 |
oct | 1731000324 |
9 | 588775310 |
10 | 258212052 |
11 | 12283259a |
12 | 72584330 |
13 | 416594c7 |
14 | 26416860 |
15 | 17a0741c |
hex | f6400d4 |
258212052 has 144 divisors (see below), whose sum is σ = 792064000. Its totient is φ = 69284160.
The previous prime is 258212047. The next prime is 258212057. The reversal of 258212052 is 250212852.
It is an interprime number because it is at equal distance from previous prime (258212047) and next prime (258212057).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (258212057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 952677 + ... + 952947.
Almost surely, 2258212052 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 258212052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (396032000).
258212052 is an abundant number, since it is smaller than the sum of its proper divisors (533851948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
258212052 is a wasteful number, since it uses less digits than its factorization.
258212052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506 (or 501 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
The square root of 258212052 is about 16068.9779388734. The cubic root of 258212052 is about 636.7840395916.
The spelling of 258212052 in words is "two hundred fifty-eight million, two hundred twelve thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •