Base | Representation |
---|---|
bin | 10000010011001011111… |
… | …000001110101110111101 |
3 | 10222002012112100211212021 |
4 | 100103023320032232331 |
5 | 121322442133342341 |
6 | 2214323343440141 |
7 | 143632264003456 |
oct | 20231370165675 |
9 | 3862175324767 |
10 | 1120112012221 |
11 | 3a20450364a4 |
12 | 1611032b6051 |
13 | 8181a741117 |
14 | 3c2dc5ca12d |
15 | 1e20b4959d1 |
hex | 104cbe0ebbd |
1120112012221 has 16 divisors (see below), whose sum is σ = 1131854400000. Its totient is φ = 1108442434176.
The previous prime is 1120112012213. The next prime is 1120112012291. The reversal of 1120112012221 is 1222102110211.
It is a cyclic number.
It is not a de Polignac number, because 1120112012221 - 23 = 1120112012213 is a prime.
It is a super-3 number, since 3×11201120122213 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120112012195 and 1120112012204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120112012291) 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, 39413865 + ... + 39442273.
It is an arithmetic number, because the mean of its divisors is an integer number (70740900000).
Almost surely, 21120112012221 is an apocalyptic number.
It is an amenable number.
1120112012221 is a deficient number, since it is larger than the sum of its proper divisors (11742387779).
1120112012221 is a wasteful number, since it uses less digits than its factorization.
1120112012221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29676.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1120112012221 its reverse (1222102110211), we get a palindrome (2342214122432).
The spelling of 1120112012221 in words is "one trillion, one hundred twenty billion, one hundred twelve million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •