Base | Representation |
---|---|
bin | 100110111010… |
… | …001111001100 |
3 | 201012012210020 |
4 | 212322033030 |
5 | 10102400022 |
6 | 1002342140 |
7 | 152461434 |
oct | 46721714 |
9 | 21165706 |
10 | 10200012 |
11 | 5837469 |
12 | 34ba950 |
13 | 2161914 |
14 | 14d72c4 |
15 | d6735c |
hex | 9ba3cc |
10200012 has 24 divisors (see below), whose sum is σ = 24444336. Its totient is φ = 3307968.
The previous prime is 10200011. The next prime is 10200037. The reversal of 10200012 is 21000201.
It is a happy number.
It is a super-3 number, since 3×102000123 (a number of 22 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is not an unprimeable number, because it can be changed into a prime (10200011) 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, 11043 + ... + 11930.
It is an arithmetic number, because the mean of its divisors is an integer number (1018514).
Almost surely, 210200012 is an apocalyptic number.
10200012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10200012 is an abundant number, since it is smaller than the sum of its proper divisors (14244324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10200012 is a wasteful number, since it uses less digits than its factorization.
10200012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23017 (or 23015 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
The square root of 10200012 is about 3193.7457632066. The cubic root of 10200012 is about 216.8703735722.
Adding to 10200012 its reverse (21000201), we get a palindrome (31200213).
The spelling of 10200012 in words is "ten million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •