Base | Representation |
---|---|
bin | 1001100110011000110100… |
… | …00101110110011011010111 |
3 | 2202202010010021101121221111 |
4 | 10303030122011312123113 |
5 | 10231332143203013421 |
6 | 112521520511555451 |
7 | 4306106325231616 |
oct | 463143205663327 |
9 | 82663107347844 |
10 | 21110202001111 |
11 | 67a9871762503 |
12 | 244b36bb2bb87 |
13 | ba18b6884552 |
14 | 52da4c62b87d |
15 | 2691d12e6ee1 |
hex | 13331a1766d7 |
21110202001111 has 4 divisors (see below), whose sum is σ = 21111194183032. Its totient is φ = 21109209819192.
The previous prime is 21110202001087. The next prime is 21110202001129. The reversal of 21110202001111 is 11110020201112.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21110202001111 - 223 = 21110193612503 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21110202001091 and 21110202001100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110202001171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 496059045 + ... + 496101598.
It is an arithmetic number, because the mean of its divisors is an integer number (5277798545758).
Almost surely, 221110202001111 is an apocalyptic number.
21110202001111 is a deficient number, since it is larger than the sum of its proper divisors (992181921).
21110202001111 is an equidigital number, since it uses as much as digits as its factorization.
21110202001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 992181920.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21110202001111 its reverse (11110020201112), we get a palindrome (32220222202223).
The spelling of 21110202001111 in words is "twenty-one trillion, one hundred ten billion, two hundred two million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •