Base | Representation |
---|---|
bin | 1010000110000111000110… |
… | …1000110100101110110101 |
3 | 1110022011022012021011201102 |
4 | 2201201301220310232311 |
5 | 2423331002104120041 |
6 | 35335152205135445 |
7 | 2223645606256310 |
oct | 241416150645665 |
9 | 43264265234642 |
10 | 11100102020021 |
11 | 359a588236183 |
12 | 12b333585a585 |
13 | 626973103871 |
14 | 2a5367d91977 |
15 | 143b1484709b |
hex | a1871a34bb5 |
11100102020021 has 8 divisors (see below), whose sum is σ = 12686420624640. Its totient is φ = 9513930851568.
The previous prime is 11100102020003. The next prime is 11100102020027. The reversal of 11100102020021 is 12002020100111.
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-11100102020021 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11100102019984 and 11100102020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100102020027) 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, 36697661 + ... + 36998898.
It is an arithmetic number, because the mean of its divisors is an integer number (1585802578080).
Almost surely, 211100102020021 is an apocalyptic number.
It is an amenable number.
11100102020021 is a deficient number, since it is larger than the sum of its proper divisors (1586318604619).
11100102020021 is an equidigital number, since it uses as much as digits as its factorization.
11100102020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73718083.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11100102020021 its reverse (12002020100111), we get a palindrome (23102122120132).
The spelling of 11100102020021 in words is "eleven trillion, one hundred billion, one hundred two million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.620 sec. • engine limits •