Base | Representation |
---|---|
bin | 1010000001011100101100… |
… | …1011111100101001101101 |
3 | 1110000111112202020000111200 |
4 | 2200113023023330221231 |
5 | 2421022430001133401 |
6 | 35234303525240113 |
7 | 2215111605435621 |
oct | 240271313745155 |
9 | 43014482200450 |
10 | 11020000021101 |
11 | 35696127a2875 |
12 | 129b8bb863039 |
13 | 61c248b08476 |
14 | 2a1529865181 |
15 | 1419c742b686 |
hex | a05cb2fca6d |
11020000021101 has 12 divisors (see below), whose sum is σ = 16072319341728. Its totient is φ = 7275339819144.
The previous prime is 11020000021097. The next prime is 11020000021157. The reversal of 11020000021101 is 10112000002011.
It is a happy number.
It is not a de Polignac number, because 11020000021101 - 22 = 11020000021097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020000021501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5943904155 + ... + 5943906008.
It is an arithmetic number, because the mean of its divisors is an integer number (1339359945144).
Almost surely, 211020000021101 is an apocalyptic number.
It is an amenable number.
11020000021101 is a deficient number, since it is larger than the sum of its proper divisors (5052319320627).
11020000021101 is a wasteful number, since it uses less digits than its factorization.
11020000021101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11887810272 (or 11887810269 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11020000021101 its reverse (10112000002011), we get a palindrome (21132000023112).
The spelling of 11020000021101 in words is "eleven trillion, twenty billion, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •