Base | Representation |
---|---|
bin | 1010001011111111000001… |
… | …0101111001000011001011 |
3 | 1110122210202210012212012112 |
4 | 2202333300111321003023 |
5 | 2432004133033324321 |
6 | 35453401320332535 |
7 | 2234150343115331 |
oct | 242776025710313 |
9 | 43583683185175 |
10 | 11201012011211 |
11 | 36293602a8110 |
12 | 130a9b831414b |
13 | 6333352c7519 |
14 | 2aa1bbc0db51 |
15 | 14656d8d3a5b |
hex | a2ff05790cb |
11201012011211 has 16 divisors (see below), whose sum is σ = 12939743416320. Its totient is φ = 9582512062080.
The previous prime is 11201012011157. The next prime is 11201012011223. The reversal of 11201012011211 is 11211021010211.
It is a cyclic number.
It is not a de Polignac number, because 11201012011211 - 222 = 11201007816907 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11201012011271) 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 15 ways as a sum of consecutive naturals, for example, 2430971 + ... + 5320868.
It is an arithmetic number, because the mean of its divisors is an integer number (808733963520).
Almost surely, 211201012011211 is an apocalyptic number.
11201012011211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11201012011211 is a deficient number, since it is larger than the sum of its proper divisors (1738731405109).
11201012011211 is a wasteful number, since it uses less digits than its factorization.
11201012011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7759594.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11201012011211 its reverse (11211021010211), we get a palindrome (22412033021422).
The spelling of 11201012011211 in words is "eleven trillion, two hundred one billion, twelve million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •