Base | Representation |
---|---|
bin | 10100100001101100… |
… | …10110001001101001 |
3 | 1001110000021002112022 |
4 | 22100312112021221 |
5 | 140032121201301 |
6 | 5021302554225 |
7 | 540042210005 |
oct | 122066261151 |
9 | 31400232468 |
10 | 11020100201 |
11 | 4745617430 |
12 | 2176738975 |
13 | 1068144566 |
14 | 767823705 |
15 | 44770ed1b |
hex | 290d96269 |
11020100201 has 4 divisors (see below), whose sum is σ = 12021927504. Its totient is φ = 10018272900.
The previous prime is 11020100183. The next prime is 11020100227. The reversal of 11020100201 is 10200102011.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10200102011 = 11 ⋅927282001.
It is a cyclic number.
It is not a de Polignac number, because 11020100201 - 226 = 10952991337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11020100801) 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, 500913635 + ... + 500913656.
It is an arithmetic number, because the mean of its divisors is an integer number (3005481876).
Almost surely, 211020100201 is an apocalyptic number.
11020100201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11020100201 is a deficient number, since it is larger than the sum of its proper divisors (1001827303).
11020100201 is a wasteful number, since it uses less digits than its factorization.
11020100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001827302.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 11020100201 its reverse (10200102011), we get a palindrome (21220202212).
The spelling of 11020100201 in words is "eleven billion, twenty million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •