Base | Representation |
---|---|
bin | 101001011101… |
… | …100011001000 |
3 | 202110012101012 |
4 | 221131203020 |
5 | 10240301221 |
6 | 1024543052 |
7 | 161245601 |
oct | 51354310 |
9 | 22405335 |
10 | 10868936 |
11 | 6153aa1 |
12 | 3781a88 |
13 | 2337230 |
14 | 162cda8 |
15 | e4a65b |
hex | a5d8c8 |
10868936 has 32 divisors (see below), whose sum is σ = 22491000. Its totient is φ = 4892160.
The previous prime is 10868917. The next prime is 10868951. The reversal of 10868936 is 63986801.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 7236100 + 3632836 = 2690^2 + 1906^2 .
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a junction number, because it is equal to n+sod(n) for n = 10868893 and 10868902.
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 7 ways as a sum of consecutive naturals, for example, 2990 + ... + 5538.
Almost surely, 210868936 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 10868936, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11245500).
10868936 is an abundant number, since it is smaller than the sum of its proper divisors (11622064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10868936 is a wasteful number, since it uses less digits than its factorization.
10868936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2609 (or 2605 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 41.
The square root of 10868936 is about 3296.8069400558. The cubic root of 10868936 is about 221.5111935466.
The spelling of 10868936 in words is "ten million, eight hundred sixty-eight thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •