Base | Representation |
---|---|
bin | 1010001101001010001110… |
… | …1001000000001101011001 |
3 | 1110201201212201111120012221 |
4 | 2203102203221000031121 |
5 | 2432322004200341441 |
6 | 35510540443304041 |
7 | 2235463540233001 |
oct | 243224351001531 |
9 | 43651781446187 |
10 | 11221200012121 |
11 | 363697a963a90 |
12 | 13128b121b021 |
13 | 6352019179a8 |
14 | 2ab175073001 |
15 | 146d50dd88d1 |
hex | a34a3a40359 |
11221200012121 has 16 divisors (see below), whose sum is σ = 12245684613120. Its totient is φ = 10197445384720.
The previous prime is 11221200012017. The next prime is 11221200012149. The reversal of 11221200012121 is 12121000212211.
It is not a de Polignac number, because 11221200012121 - 211 = 11221200010073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11221200012095 and 11221200012104.
It is not an unprimeable number, because it can be changed into a prime (11221200012151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 530718276 + ... + 530739418.
It is an arithmetic number, because the mean of its divisors is an integer number (765355288320).
Almost surely, 211221200012121 is an apocalyptic number.
11221200012121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11221200012121 is a deficient number, since it is larger than the sum of its proper divisors (1024484600999).
11221200012121 is a wasteful number, since it uses less digits than its factorization.
11221200012121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36116.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11221200012121 its reverse (12121000212211), we get a palindrome (23342200224332).
The spelling of 11221200012121 in words is "eleven trillion, two hundred twenty-one billion, two hundred million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •