Base | Representation |
---|---|
bin | 10011101010011100… |
… | …001010010101110111 |
3 | 2000111102001121222211 |
4 | 103222130022111313 |
5 | 321214424320434 |
6 | 13411011234251 |
7 | 1345126363030 |
oct | 235234122567 |
9 | 60442047884 |
10 | 21113120119 |
11 | 8a54895703 |
12 | 41128a8987 |
13 | 1cb61a03b0 |
14 | 104407ba87 |
15 | 838844464 |
hex | 4ea70a577 |
21113120119 has 32 divisors (see below), whose sum is σ = 26485401600. Its totient is φ = 16385846400.
The previous prime is 21113120117. The next prime is 21113120129. The reversal of 21113120119 is 91102131112.
It is not a de Polignac number, because 21113120119 - 21 = 21113120117 is a prime.
It is a super-2 number, since 2×211131201192 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21113120119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21113120111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1277529 + ... + 1293949.
It is an arithmetic number, because the mean of its divisors is an integer number (827668800).
Almost surely, 221113120119 is an apocalyptic number.
21113120119 is a deficient number, since it is larger than the sum of its proper divisors (5372281481).
21113120119 is a wasteful number, since it uses less digits than its factorization.
21113120119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16711.
The product of its (nonzero) digits is 108, while the sum is 22.
The spelling of 21113120119 in words is "twenty-one billion, one hundred thirteen million, one hundred twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •