Base | Representation |
---|---|
bin | 1010000110001011001100… |
… | …1001111010001011011001 |
3 | 1110022021010210120220210221 |
4 | 2201202303021322023121 |
5 | 2423340230002241441 |
6 | 35335453232440041 |
7 | 2224015054246066 |
oct | 241426311721331 |
9 | 43267123526727 |
10 | 11101201212121 |
11 | 359aaa17494a9 |
12 | 12b35a19a9021 |
13 | 626ab9a608a7 |
14 | 2a542dd5dc6d |
15 | 143b7b0bd8d1 |
hex | a18b327a2d9 |
11101201212121 has 8 divisors (see below), whose sum is σ = 11226102962400. Its totient is φ = 10976303220960.
The previous prime is 11101201212097. The next prime is 11101201212131. The reversal of 11101201212121 is 12121210210111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11101201212121 - 213 = 11101201203929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11101201212095 and 11101201212104.
It is not an unprimeable number, because it can be changed into a prime (11101201212131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5226010 + ... + 7036588.
It is an arithmetic number, because the mean of its divisors is an integer number (1403262870300).
Almost surely, 211101201212121 is an apocalyptic number.
It is an amenable number.
11101201212121 is a deficient number, since it is larger than the sum of its proper divisors (124901750279).
11101201212121 is an equidigital number, since it uses as much as digits as its factorization.
11101201212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1879559.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11101201212121 its reverse (12121210210111), we get a palindrome (23222411422232).
The spelling of 11101201212121 in words is "eleven trillion, one hundred one billion, two hundred one million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •