Base | Representation |
---|---|
bin | 101000010000… |
… | …0111000011111 |
3 | 1110201022021101 |
4 | 1100200320133 |
5 | 20400344312 |
6 | 2032213531 |
7 | 344254063 |
oct | 120407037 |
9 | 43638241 |
10 | 21106207 |
11 | 10a06451 |
12 | 709a2a7 |
13 | 44acaa5 |
14 | 2b35aa3 |
15 | 1cbda57 |
hex | 1420e1f |
21106207 has 8 divisors (see below), whose sum is σ = 22264560. Its totient is φ = 19952640.
The previous prime is 21106201. The next prime is 21106213. The reversal of 21106207 is 70260112.
It is an interprime number because it is at equal distance from previous prime (21106201) and next prime (21106213).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21106207 - 23 = 21106199 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21106201) by changing a digit.
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, 11313 + ... + 13045.
It is an arithmetic number, because the mean of its divisors is an integer number (2783070).
Almost surely, 221106207 is an apocalyptic number.
21106207 is a deficient number, since it is larger than the sum of its proper divisors (1158353).
21106207 is a wasteful number, since it uses less digits than its factorization.
21106207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2393.
The product of its (nonzero) digits is 168, while the sum is 19.
The square root of 21106207 is about 4594.1492139459. The cubic root of 21106207 is about 276.3567421900.
Adding to 21106207 its reverse (70260112), we get a palindrome (91366319).
The spelling of 21106207 in words is "twenty-one million, one hundred six thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •