Base | Representation |
---|---|
bin | 101000000110… |
… | …011010001100 |
3 | 201210001202210 |
4 | 220012122030 |
5 | 10142341022 |
6 | 1013150420 |
7 | 155231160 |
oct | 50063214 |
9 | 21701683 |
10 | 10512012 |
11 | 5a2a915 |
12 | 362b410 |
13 | 2240934 |
14 | 1578ca0 |
15 | dc9a0c |
hex | a0668c |
10512012 has 48 divisors (see below), whose sum is σ = 29256192. Its totient is φ = 2872320.
The previous prime is 10512011. The next prime is 10512013. The reversal of 10512012 is 21021501.
It is an interprime number because it is at equal distance from previous prime (10512011) and next prime (10512013).
It is a super-2 number, since 2×105120122 = 221004792576288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (10512011) 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, 789 + ... + 4652.
It is an arithmetic number, because the mean of its divisors is an integer number (609504).
Almost surely, 210512012 is an apocalyptic number.
10512012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10512012 is an abundant number, since it is smaller than the sum of its proper divisors (18744180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10512012 is a wasteful number, since it uses less digits than its factorization.
10512012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5478 (or 5476 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 12.
The square root of 10512012 is about 3242.2233112480. The cubic root of 10512012 is about 219.0594280038.
Adding to 10512012 its reverse (21021501), we get a palindrome (31533513).
The spelling of 10512012 in words is "ten million, five hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •