Base | Representation |
---|---|
bin | 1010000110101100110010… |
… | …1101111011110110000001 |
3 | 1110100010102100001212220220 |
4 | 2201223030231323312001 |
5 | 2424012212311133441 |
6 | 35343544205053253 |
7 | 2224454415665634 |
oct | 241531455736601 |
9 | 43303370055826 |
10 | 11110220021121 |
11 | 35a38aa617161 |
12 | 12b529a257229 |
13 | 6278c6398170 |
14 | 2a5a47a6dc1b |
15 | 144007c63466 |
hex | a1accb7bd81 |
11110220021121 has 16 divisors (see below), whose sum is σ = 16019885978880. Its totient is φ = 6808451529600.
The previous prime is 11110220021113. The next prime is 11110220021149. The reversal of 11110220021121 is 12112002201111.
It is a happy number.
It is not a de Polignac number, because 11110220021121 - 23 = 11110220021113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11110220021121.
It is not an unprimeable number, because it can be changed into a prime (11110220021171) 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, 595968580 + ... + 595987221.
It is an arithmetic number, because the mean of its divisors is an integer number (1001242873680).
Almost surely, 211110220021121 is an apocalyptic number.
It is an amenable number.
11110220021121 is a deficient number, since it is larger than the sum of its proper divisors (4909665957759).
11110220021121 is a wasteful number, since it uses less digits than its factorization.
11110220021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1191956056.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11110220021121 its reverse (12112002201111), we get a palindrome (23222222222232).
The spelling of 11110220021121 in words is "eleven trillion, one hundred ten billion, two hundred twenty million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •