Base | Representation |
---|---|
bin | 100111101110… |
… | …001000011000 |
3 | 201121000100200 |
4 | 213232020120 |
5 | 10131200233 |
6 | 1011102200 |
7 | 154335225 |
oct | 47561030 |
9 | 21530320 |
10 | 10412568 |
11 | 5972131 |
12 | 35a1960 |
13 | 22075aa |
14 | 155094c |
15 | daa313 |
hex | 9ee218 |
10412568 has 96 divisors (see below), whose sum is σ = 30663360. Its totient is φ = 3179520.
The previous prime is 10412557. The next prime is 10412573. The reversal of 10412568 is 86521401.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 57438 + ... + 57618.
It is an arithmetic number, because the mean of its divisors is an integer number (319410).
Almost surely, 210412568 is an apocalyptic number.
10412568 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 10412568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15331680).
10412568 is an abundant number, since it is smaller than the sum of its proper divisors (20250792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10412568 is a wasteful number, since it uses less digits than its factorization.
10412568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257 (or 250 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 10412568 is about 3226.8510966575. The cubic root of 10412568 is about 218.3664683053.
Adding to 10412568 its reverse (86521401), we get a palindrome (96933969).
The spelling of 10412568 in words is "ten million, four hundred twelve thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •