Base | Representation |
---|---|
bin | 10011101010010000… |
… | …101011101100110111 |
3 | 2000111012101202022010 |
4 | 103222100223230313 |
5 | 321213142023111 |
6 | 13410422535303 |
7 | 1345061661132 |
oct | 235220535467 |
9 | 60435352263 |
10 | 21110111031 |
11 | 8a5311a959 |
12 | 4111897533 |
13 | 1cb5688879 |
14 | 10438d7219 |
15 | 83844caa6 |
hex | 4ea42bb37 |
21110111031 has 8 divisors (see below), whose sum is σ = 28147489920. Its totient is φ = 14073069752.
The previous prime is 21110111003. The next prime is 21110111041. The reversal of 21110111031 is 13011101112.
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 21110111031 - 215 = 21110078263 is a prime.
It is a super-2 number, since 2×211101110312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21110110998 and 21110111016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110111041) 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 7 ways as a sum of consecutive naturals, for example, 178390 + ... + 272108.
It is an arithmetic number, because the mean of its divisors is an integer number (3518436240).
Almost surely, 221110111031 is an apocalyptic number.
21110111031 is a deficient number, since it is larger than the sum of its proper divisors (7037378889).
21110111031 is an equidigital number, since it uses as much as digits as its factorization.
21110111031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168805.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 21110111031 its reverse (13011101112), we get a palindrome (34121212143).
The spelling of 21110111031 in words is "twenty-one billion, one hundred ten million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •