Base | Representation |
---|---|
bin | 1010000001011101000111… |
… | …0111001100011001110111 |
3 | 1110000111211112222012122012 |
4 | 2200113101313030121313 |
5 | 2421023142134133421 |
6 | 35234323005554435 |
7 | 2215114435430354 |
oct | 240272167143167 |
9 | 43014745865565 |
10 | 11020112021111 |
11 | 356966aa40066 |
12 | 129b931275a1b |
13 | 61c266090c6b |
14 | 2a153a69b62b |
15 | 1419d21a195b |
hex | a05d1dcc677 |
11020112021111 has 8 divisors (see below), whose sum is σ = 11131705037424. Its totient is φ = 10908567691200.
The previous prime is 11020112021041. The next prime is 11020112021117. The reversal of 11020112021111 is 11112021102011.
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 11020112021111 - 210 = 11020112020087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020112021117) 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 7 ways as a sum of consecutive naturals, for example, 11716526 + ... + 12622091.
It is an arithmetic number, because the mean of its divisors is an integer number (1391463129678).
Almost surely, 211020112021111 is an apocalyptic number.
11020112021111 is a deficient number, since it is larger than the sum of its proper divisors (111593016313).
11020112021111 is a wasteful number, since it uses less digits than its factorization.
11020112021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24343201.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11020112021111 its reverse (11112021102011), we get a palindrome (22132133123122).
The spelling of 11020112021111 in words is "eleven trillion, twenty billion, one hundred twelve million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •