Base | Representation |
---|---|
bin | 101000010000… |
… | …0110101101101 |
3 | 1110201022000210 |
4 | 1100200311231 |
5 | 20400343104 |
6 | 2032213033 |
7 | 344253420 |
oct | 120406555 |
9 | 43638023 |
10 | 21106029 |
11 | 10a062aa |
12 | 709a179 |
13 | 44ac999 |
14 | 2b359b7 |
15 | 1cbd989 |
hex | 1420d6d |
21106029 has 8 divisors (see below), whose sum is σ = 32161600. Its totient is φ = 12060576.
The previous prime is 21105977. The next prime is 21106037. The reversal of 21106029 is 92060112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21106029 - 212 = 21101933 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 1005049 = 21106029 / (2 + 1 + 1 + 0 + 6 + 0 + 2 + 9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21105996 and 21106014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21106049) 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, 502504 + ... + 502545.
It is an arithmetic number, because the mean of its divisors is an integer number (4020200).
Almost surely, 221106029 is an apocalyptic number.
It is an amenable number.
21106029 is a deficient number, since it is larger than the sum of its proper divisors (11055571).
21106029 is a wasteful number, since it uses less digits than its factorization.
21106029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1005059.
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 21106029 is about 4594.1298414390. The cubic root of 21106029 is about 276.3559652994.
The spelling of 21106029 in words is "twenty-one million, one hundred six thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •