Base | Representation |
---|---|
bin | 10100101011011101… |
… | …10110000110110101 |
3 | 1001122201102001101201 |
4 | 22111232312012311 |
5 | 140214104120041 |
6 | 5033350452501 |
7 | 542055420211 |
oct | 122556660665 |
9 | 31581361351 |
10 | 11102020021 |
11 | 4787889a64 |
12 | 219a064131 |
13 | 107c0c7721 |
14 | 774669941 |
15 | 44e9e2631 |
hex | 295bb61b5 |
11102020021 has 4 divisors (see below), whose sum is σ = 11242552000. Its totient is φ = 10961488044.
The previous prime is 11102020019. The next prime is 11102020031. The reversal of 11102020021 is 12002020111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11102020021 - 21 = 11102020019 is a prime.
It is a super-3 number, since 3×111020200213 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102020001) 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 3 ways as a sum of consecutive naturals, for example, 70265871 + ... + 70266028.
It is an arithmetic number, because the mean of its divisors is an integer number (2810638000).
Almost surely, 211102020021 is an apocalyptic number.
It is an amenable number.
11102020021 is a deficient number, since it is larger than the sum of its proper divisors (140531979).
11102020021 is an equidigital number, since it uses as much as digits as its factorization.
11102020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140531978.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11102020021 its reverse (12002020111), we get a palindrome (23104040132).
The spelling of 11102020021 in words is "eleven billion, one hundred two million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •