Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …1010101001101101110001 |
3 | 1102222122212220221200211121 |
4 | 2200032333322221231301 |
5 | 2420401440034044441 |
6 | 35230252440342241 |
7 | 2214351215141203 |
oct | 240167772515561 |
9 | 42878786850747 |
10 | 11011221003121 |
11 | 3565918215709 |
12 | 129a06b774981 |
13 | 61b47a07a881 |
14 | 2a0d35934773 |
15 | 141661850dd1 |
hex | a03bfea9b71 |
11011221003121 has 8 divisors (see below), whose sum is σ = 11032612196000. Its totient is φ = 10989847355040.
The previous prime is 11011221003109. The next prime is 11011221003131. The reversal of 11011221003121 is 12130012211011.
It is a happy number.
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 11011221003121 - 233 = 11002631068529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011221003095 and 11011221003104.
It is not an unprimeable number, because it can be changed into a prime (11011221003131) 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, 3129420 + ... + 5640541.
It is an arithmetic number, because the mean of its divisors is an integer number (1379076524500).
Almost surely, 211011221003121 is an apocalyptic number.
It is an amenable number.
11011221003121 is a deficient number, since it is larger than the sum of its proper divisors (21391192879).
11011221003121 is an equidigital number, since it uses as much as digits as its factorization.
11011221003121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8772399.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 11011221003121 its reverse (12130012211011), we get a palindrome (23141233214132).
The spelling of 11011221003121 in words is "eleven trillion, eleven billion, two hundred twenty-one million, three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •