Base | Representation |
---|---|
bin | 100111001000… |
… | …101100001000 |
3 | 201022012222200 |
4 | 213020230020 |
5 | 10111243313 |
6 | 1003520200 |
7 | 153126141 |
oct | 47105410 |
9 | 21265880 |
10 | 10259208 |
11 | 5877993 |
12 | 3529060 |
13 | 218284b |
14 | 1510ac8 |
15 | d79b73 |
hex | 9c8b08 |
10259208 has 48 divisors (see below), whose sum is σ = 28115100. Its totient is φ = 3379200.
The previous prime is 10259203. The next prime is 10259237. The reversal of 10259208 is 80295201.
It is a Cunningham number, because it is equal to 32032-1.
It can be written as a sum of positive squares in 2 ways, for example, as 9847044 + 412164 = 3138^2 + 642^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10259203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5608 + ... + 7208.
Almost surely, 210259208 is an apocalyptic number.
10259208 is a gapful number since it is divisible by the number (18) 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 10259208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14057550).
10259208 is an abundant number, since it is smaller than the sum of its proper divisors (17855892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10259208 is a wasteful number, since it uses less digits than its factorization.
10259208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1702 (or 1695 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 10259208 is about 3202.9998438963. Note that the first 3 decimals coincide. The cubic root of 10259208 is about 217.2891019509.
The spelling of 10259208 in words is "ten million, two hundred fifty-nine thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •