Base | Representation |
---|---|
bin | 10000010011001011110… |
… | …001010100110101101100 |
3 | 10222002012101221220000012 |
4 | 100103023301110311230 |
5 | 121322441202432340 |
6 | 2214323240552352 |
7 | 143632242424502 |
oct | 20231361246554 |
9 | 3862171856005 |
10 | 1120110202220 |
11 | 3a204400a629 |
12 | 1611027826b8 |
13 | 8181a259309 |
14 | 3c2dc278672 |
15 | 1e20b239565 |
hex | 104cbc54d6c |
1120110202220 has 24 divisors (see below), whose sum is σ = 2352331716000. Its totient is φ = 448024977792.
The previous prime is 1120110202219. The next prime is 1120110202231. The reversal of 1120110202220 is 222020110211.
It is a junction number, because it is equal to n+sod(n) for n = 1120110202195 and 1120110202204.
It is an unprimeable number.
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, 708320 + ... + 1655879.
It is an arithmetic number, because the mean of its divisors is an integer number (98013821500).
Almost surely, 21120110202220 is an apocalyptic number.
1120110202220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1120110202220 is an abundant number, since it is smaller than the sum of its proper divisors (1232221513780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120110202220 is a wasteful number, since it uses less digits than its factorization.
1120110202220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2387897 (or 2387895 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1120110202220 its reverse (222020110211), we get a palindrome (1342130312431).
The spelling of 1120110202220 in words is "one trillion, one hundred twenty billion, one hundred ten million, two hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •