Base | Representation |
---|---|
bin | 1010000110000111001010… |
… | …1101110111111101111011 |
3 | 1110022011100110022210212212 |
4 | 2201201302231313331323 |
5 | 2423331021222334321 |
6 | 35335154053125335 |
7 | 2223646216156412 |
oct | 241416255677573 |
9 | 43264313283785 |
10 | 11100120121211 |
11 | 359a597479940 |
12 | 12b333b92984b |
13 | 626976aa0924 |
14 | 2a536a544479 |
15 | 143b1622055b |
hex | a1872b77f7b |
11100120121211 has 4 divisors (see below), whose sum is σ = 12109221950424. Its totient is φ = 10091018292000.
The previous prime is 11100120121201. The next prime is 11100120121231. The reversal of 11100120121211 is 11212102100111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11100120121211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11100120121201) 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, 504550914590 + ... + 504550914611.
It is an arithmetic number, because the mean of its divisors is an integer number (3027305487606).
Almost surely, 211100120121211 is an apocalyptic number.
11100120121211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11100120121211 is a deficient number, since it is larger than the sum of its proper divisors (1009101829213).
11100120121211 is a wasteful number, since it uses less digits than its factorization.
11100120121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009101829212.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11100120121211 its reverse (11212102100111), we get a palindrome (22312222221322).
The spelling of 11100120121211 in words is "eleven trillion, one hundred billion, one hundred twenty million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •