Base | Representation |
---|---|
bin | 10000010011001011110… |
… | …100011010000110101101 |
3 | 10222002012110110221101011 |
4 | 100103023310122012231 |
5 | 121322441404311341 |
6 | 2214323310145221 |
7 | 143632252331260 |
oct | 20231364320655 |
9 | 3862173427334 |
10 | 1120111010221 |
11 | 3a20445116a5 |
12 | 161102ab2211 |
13 | 8181a480018 |
14 | 3c2dc408cd7 |
15 | 1e20b348b81 |
hex | 104cbd1a1ad |
1120111010221 has 8 divisors (see below), whose sum is σ = 1280134126784. Its totient is φ = 960089708160.
The previous prime is 1120111010219. The next prime is 1120111010279. The reversal of 1120111010221 is 1220101110211.
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 1120111010221 - 21 = 1120111010219 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120111013221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1344226 + ... + 2011756.
It is an arithmetic number, because the mean of its divisors is an integer number (160016765848).
Almost surely, 21120111010221 is an apocalyptic number.
It is an amenable number.
1120111010221 is a deficient number, since it is larger than the sum of its proper divisors (160023116563).
1120111010221 is an equidigital number, since it uses as much as digits as its factorization.
1120111010221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 907251.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1120111010221 its reverse (1220101110211), we get a palindrome (2340212120432).
The spelling of 1120111010221 in words is "one trillion, one hundred twenty billion, one hundred eleven million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •