Base | Representation |
---|---|
bin | 10011100100111001… |
… | …101101000010010111 |
3 | 2000020221012212002002 |
4 | 103210321231002113 |
5 | 321022132413421 |
6 | 13353451505515 |
7 | 1342620522110 |
oct | 234471550227 |
9 | 60227185062 |
10 | 21020201111 |
11 | 8a073a0238 |
12 | 40a775829b |
13 | 1c9cb68930 |
14 | 10359b1207 |
15 | 8305dcb0b |
hex | 4e4e6d097 |
21020201111 has 8 divisors (see below), whose sum is σ = 25871016864. Its totient is φ = 16631367840.
The previous prime is 21020201099. The next prime is 21020201113. The reversal of 21020201111 is 11110202012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21020201111 is a prime.
It is a super-3 number, since 3×210202011113 (a number of 32 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21020201092 and 21020201101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21020201113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 115495520 + ... + 115495701.
It is an arithmetic number, because the mean of its divisors is an integer number (3233877108).
Almost surely, 221020201111 is an apocalyptic number.
21020201111 is a deficient number, since it is larger than the sum of its proper divisors (4850815753).
21020201111 is a wasteful number, since it uses less digits than its factorization.
21020201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 230991241.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21020201111 its reverse (11110202012), we get a palindrome (32130403123).
Subtracting from 21020201111 its reverse (11110202012), we obtain a palindrome (9909999099).
The spelling of 21020201111 in words is "twenty-one billion, twenty million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •