Base | Representation |
---|---|
bin | 1010000111010001010001… |
… | …0111110101010001111011 |
3 | 1110101001200202122002222121 |
4 | 2201310110113311101323 |
5 | 2424142241100334321 |
6 | 35352244003502111 |
7 | 2225252160321460 |
oct | 241642427652173 |
9 | 43331622562877 |
10 | 11120012121211 |
11 | 35a7a74a42964 |
12 | 12b7171687937 |
13 | 6287c6c93626 |
14 | 2a62d6355667 |
15 | 1443cc756441 |
hex | a1d145f547b |
11120012121211 has 8 divisors (see below), whose sum is σ = 12729182669280. Its totient is φ = 9515990920128.
The previous prime is 11120012121203. The next prime is 11120012121259. The reversal of 11120012121211 is 11212121002111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11120012121211 - 23 = 11120012121203 is a prime.
It is a super-2 number, since 2×111200121212112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11120012181211) 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, 1287332116 + ... + 1287340753.
It is an arithmetic number, because the mean of its divisors is an integer number (1591147833660).
Almost surely, 211120012121211 is an apocalyptic number.
11120012121211 is a deficient number, since it is larger than the sum of its proper divisors (1609170548069).
11120012121211 is an equidigital number, since it uses as much as digits as its factorization.
11120012121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2574673493.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11120012121211 its reverse (11212121002111), we get a palindrome (22332133123322).
The spelling of 11120012121211 in words is "eleven trillion, one hundred twenty billion, twelve million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •