Base | Representation |
---|---|
bin | 1010000111010101110001… |
… | …1111001010000111001101 |
3 | 1110101011211002020101011220 |
4 | 2201311130133022013031 |
5 | 2424202230313013401 |
6 | 35353004023433553 |
7 | 2225324151166212 |
oct | 241653437120715 |
9 | 43334732211156 |
10 | 11121222001101 |
11 | 35a85359875a3 |
12 | 12b744a8b58b9 |
13 | 62895a836aa4 |
14 | 2a63accd7b09 |
15 | 14444da94336 |
hex | a1d5c7ca1cd |
11121222001101 has 8 divisors (see below), whose sum is σ = 14865274297344. Its totient is φ = 7395658852800.
The previous prime is 11121222001067. The next prime is 11121222001121. The reversal of 11121222001101 is 10110022212111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11121222001101 - 29 = 11121222000589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11121222001121) 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, 4622285581 + ... + 4622287986.
It is an arithmetic number, because the mean of its divisors is an integer number (1858159287168).
Almost surely, 211121222001101 is an apocalyptic number.
It is an amenable number.
11121222001101 is a deficient number, since it is larger than the sum of its proper divisors (3744052296243).
11121222001101 is an equidigital number, since it uses as much as digits as its factorization.
11121222001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9244573971.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11121222001101 its reverse (10110022212111), we get a palindrome (21231244213212).
The spelling of 11121222001101 in words is "eleven trillion, one hundred twenty-one billion, two hundred twenty-two million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •