Base | Representation |
---|---|
bin | 11110100001100010100 |
3 | 1212211000220 |
4 | 3310030110 |
5 | 224001322 |
6 | 33234340 |
7 | 11334033 |
oct | 3641424 |
9 | 1784026 |
10 | 1000212 |
11 | 623524 |
12 | 4029b0 |
13 | 290355 |
14 | 1c071a |
15 | 14b55c |
hex | f4314 |
1000212 has 24 divisors (see below), whose sum is σ = 2471616. Its totient is φ = 313728.
The previous prime is 1000211. The next prime is 1000213. The reversal of 1000212 is 2120001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1000211) and next prime (1000213).
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a self number, because there is not a number n which added to its sum of digits gives 1000212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2248 + ... + 2655.
It is an arithmetic number, because the mean of its divisors is an integer number (102984).
21000212 is an apocalyptic number.
1000212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1000212 is an abundant number, since it is smaller than the sum of its proper divisors (1471404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000212 is a wasteful number, since it uses less digits than its factorization.
1000212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4927 (or 4925 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
The square root of 1000212 is about 1000.1059943826. The cubic root of 1000212 is about 100.0070661673.
Adding to 1000212 its reverse (2120001), we get a palindrome (3120213).
The spelling of 1000212 in words is "one million, two hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •