Base | Representation |
---|---|
bin | 1010000110001100000001… |
… | …1100001101001001010011 |
3 | 1110022021201100000102020211 |
4 | 2201203000130031021103 |
5 | 2423341204033042321 |
6 | 35335531314144551 |
7 | 2224023432001426 |
oct | 241430034151123 |
9 | 43267640012224 |
10 | 11101424112211 |
11 | 35a00a6552654 |
12 | 12b3644582157 |
13 | 626b23ca5334 |
14 | 2a54517c39bd |
15 | 143b9094d0e1 |
hex | a18c070d253 |
11101424112211 has 4 divisors (see below), whose sum is σ = 11253498415192. Its totient is φ = 10949349809232.
The previous prime is 11101424112193. The next prime is 11101424112263. The reversal of 11101424112211 is 11221142410111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11101424112211 - 235 = 11067064373843 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11101424212211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76037151381 + ... + 76037151526.
It is an arithmetic number, because the mean of its divisors is an integer number (2813374603798).
Almost surely, 211101424112211 is an apocalyptic number.
11101424112211 is a deficient number, since it is larger than the sum of its proper divisors (152074302981).
11101424112211 is an equidigital number, since it uses as much as digits as its factorization.
11101424112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152074302980.
The product of its (nonzero) digits is 128, while the sum is 22.
Adding to 11101424112211 its reverse (11221142410111), we get a palindrome (22322566522322).
The spelling of 11101424112211 in words is "eleven trillion, one hundred one billion, four hundred twenty-four million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •