Base | Representation |
---|---|
bin | 1010000111010001100110… |
… | …1110101111010100111101 |
3 | 1110101001221000210001021021 |
4 | 2201310121232233110331 |
5 | 2424142432103342341 |
6 | 35352300534304141 |
7 | 2225254331351416 |
oct | 241643156572475 |
9 | 43331830701237 |
10 | 11120102012221 |
11 | 35a801075a354 |
12 | 12b71977b8051 |
13 | 62880c7a7a87 |
14 | 2a630427480d |
15 | 1443d55b09d1 |
hex | a1d19baf53d |
11120102012221 has 8 divisors (see below), whose sum is σ = 11783930076000. Its totient is φ = 10464129902160.
The previous prime is 11120102012207. The next prime is 11120102012237. The reversal of 11120102012221 is 12221020102111.
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 11120102012221 - 213 = 11120102004029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11120102012195 and 11120102012204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120102015221) 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, 1963985515 + ... + 1963991176.
It is an arithmetic number, because the mean of its divisors is an integer number (1472991259500).
Almost surely, 211120102012221 is an apocalyptic number.
It is an amenable number.
11120102012221 is a deficient number, since it is larger than the sum of its proper divisors (663828063779).
11120102012221 is a wasteful number, since it uses less digits than its factorization.
11120102012221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3927976859.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11120102012221 its reverse (12221020102111), we get a palindrome (23341122114332).
The spelling of 11120102012221 in words is "eleven trillion, one hundred twenty billion, one hundred two million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •