Base | Representation |
---|---|
bin | 1001100110000101111111… |
… | …11110100010101010010111 |
3 | 2202201011001021002000110202 |
4 | 10303002333332202222113 |
5 | 10231201001122413421 |
6 | 112513130251211115 |
7 | 4305301103316641 |
oct | 463027776425227 |
9 | 82634037060422 |
10 | 21100100201111 |
11 | 67a5558537668 |
12 | 2449410a46a9b |
13 | ba0966a731b9 |
14 | 52d370b69891 |
15 | 268cde52b10b |
hex | 1330bffa2a97 |
21100100201111 has 8 divisors (see below), whose sum is σ = 22117405090704. Its totient is φ = 20106731897280.
The previous prime is 21100100201101. The next prime is 21100100201119. The reversal of 21100100201111 is 11110200100112.
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 21100100201111 - 214 = 21100100184727 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21100100201092 and 21100100201101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21100100201119) 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, 5984144636 + ... + 5984148161.
It is an arithmetic number, because the mean of its divisors is an integer number (2764675636338).
Almost surely, 221100100201111 is an apocalyptic number.
21100100201111 is a deficient number, since it is larger than the sum of its proper divisors (1017304889593).
21100100201111 is a wasteful number, since it uses less digits than its factorization.
21100100201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11968292881.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 21100100201111 its reverse (11110200100112), we get a palindrome (32210300301223).
The spelling of 21100100201111 in words is "twenty-one trillion, one hundred billion, one hundred million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •