Base | Representation |
---|---|
bin | 1010001101000110001101… |
… | …0001000111110110001001 |
3 | 1110201122002110021202222212 |
4 | 2203101203101013312021 |
5 | 2432312301210310441 |
6 | 35510241343154505 |
7 | 2235425014330061 |
oct | 243214321076611 |
9 | 43648073252885 |
10 | 11220120010121 |
11 | 3636476268550 |
12 | 131264b5a5a35 |
13 | 63508bc49559 |
14 | 2ab0b185c3a1 |
15 | 146cdb1a2eeb |
hex | a3463447d89 |
11220120010121 has 16 divisors (see below), whose sum is σ = 12469001146560. Its totient is φ = 10010515817280.
The previous prime is 11220120010093. The next prime is 11220120010129. The reversal of 11220120010121 is 12101002102211.
It is not a de Polignac number, because 11220120010121 - 226 = 11220052901257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11220120010096 and 11220120010105.
It is not an unprimeable number, because it can be changed into a prime (11220120010129) 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, 28099226 + ... + 28495731.
It is an arithmetic number, because the mean of its divisors is an integer number (779312571660).
Almost surely, 211220120010121 is an apocalyptic number.
11220120010121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11220120010121 is a deficient number, since it is larger than the sum of its proper divisors (1248881136439).
11220120010121 is a wasteful number, since it uses less digits than its factorization.
11220120010121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56595304.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11220120010121 its reverse (12101002102211), we get a palindrome (23321122112332).
The spelling of 11220120010121 in words is "eleven trillion, two hundred twenty billion, one hundred twenty million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •