Base | Representation |
---|---|
bin | 10011101010010001… |
… | …000001111010011101 |
3 | 2000111012120101002211 |
4 | 103222101001322131 |
5 | 321213202431023 |
6 | 13410424520421 |
7 | 1345062520315 |
oct | 235221017235 |
9 | 60435511084 |
10 | 21110202013 |
11 | 8a5318224a |
12 | 4111920111 |
13 | 1cb56bb0c4 |
14 | 104391c445 |
15 | 838469a0d |
hex | 4ea441e9d |
21110202013 has 16 divisors (see below), whose sum is σ = 22702567680. Its totient is φ = 19558296576.
The previous prime is 21110201953. The next prime is 21110202049. The reversal of 21110202013 is 31020201112.
It is a cyclic number.
It is not a de Polignac number, because 21110202013 - 29 = 21110201501 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21110201984 and 21110202002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110202083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 429270 + ... + 475912.
It is an arithmetic number, because the mean of its divisors is an integer number (1418910480).
Almost surely, 221110202013 is an apocalyptic number.
It is an amenable number.
21110202013 is a deficient number, since it is larger than the sum of its proper divisors (1592365667).
21110202013 is a wasteful number, since it uses less digits than its factorization.
21110202013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47076.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 21110202013 its reverse (31020201112), we get a palindrome (52130403125).
Subtracting 21110202013 from its reverse (31020201112), we obtain a palindrome (9909999099).
The spelling of 21110202013 in words is "twenty-one billion, one hundred ten million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •