Base | Representation |
---|---|
bin | 101000000000… |
… | …000111000100 |
3 | 201201202101020 |
4 | 220000013010 |
5 | 10141024322 |
6 | 1012431140 |
7 | 155063022 |
oct | 50000704 |
9 | 21652336 |
10 | 10486212 |
11 | 5a124a0 |
12 | 36184b0 |
13 | 2231c79 |
14 | 156d712 |
15 | dc205c |
hex | a001c4 |
10486212 has 48 divisors (see below), whose sum is σ = 28268352. Its totient is φ = 2990080.
The previous prime is 10486193. The next prime is 10486219. The reversal of 10486212 is 21268401.
It is not an unprimeable number, because it can be changed into a prime (10486219) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93 + ... + 4580.
It is an arithmetic number, because the mean of its divisors is an integer number (588924).
Almost surely, 210486212 is an apocalyptic number.
10486212 is a gapful number since it is divisible by the number (12) 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 10486212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14134176).
10486212 is an abundant number, since it is smaller than the sum of its proper divisors (17782140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10486212 is a wasteful number, since it uses less digits than its factorization.
10486212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4708 (or 4706 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 24.
The square root of 10486212 is about 3238.2421157165. The cubic root of 10486212 is about 218.8800661047.
It can be divided in two parts, 1048 and 6212, that added together give a triangular number (7260 = T120).
The spelling of 10486212 in words is "ten million, four hundred eighty-six thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •