Base | Representation |
---|---|
bin | 100111001000… |
… | …101111001110 |
3 | 201022020021000 |
4 | 213020233032 |
5 | 10111300111 |
6 | 1003521130 |
7 | 153126543 |
oct | 47105716 |
9 | 21266230 |
10 | 10259406 |
11 | 5878053 |
12 | 35291a6 |
13 | 2182971 |
14 | 1510bca |
15 | d79c56 |
hex | 9c8bce |
10259406 has 16 divisors (see below), whose sum is σ = 22798800. Its totient is φ = 3419784.
The previous prime is 10259401. The next prime is 10259443. The reversal of 10259406 is 60495201.
10259406 is a `hidden beast` number, since 1 + 0 + 259 + 406 = 666.
It is a super-2 number, since 2×102594062 = 210510822945672, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 10259406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10259401) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 94941 + ... + 95048.
It is an arithmetic number, because the mean of its divisors is an integer number (1424925).
Almost surely, 210259406 is an apocalyptic number.
10259406 is an abundant number, since it is smaller than the sum of its proper divisors (12539394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10259406 is a wasteful number, since it uses less digits than its factorization.
10259406 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190000 (or 189994 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 10259406 is about 3203.0307522720. The cubic root of 10259406 is about 217.2904998160.
The spelling of 10259406 in words is "ten million, two hundred fifty-nine thousand, four hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •