Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …010001010001111011100 |
3 | 10221010101120001221212210 |
4 | 100021313302022033130 |
5 | 121142001431401340 |
6 | 2205551131400420 |
7 | 143126406340251 |
oct | 20116762121734 |
9 | 3833346057783 |
10 | 1110111200220 |
11 | 398882917410 |
12 | 15b191bb3110 |
13 | 808b582b199 |
14 | 3ba302d5428 |
15 | 1dd234c7180 |
hex | 10277c8a3dc |
1110111200220 has 96 divisors (see below), whose sum is σ = 3469743002880. Its totient is φ = 262859304960.
The previous prime is 1110111200203. The next prime is 1110111200251. The reversal of 1110111200220 is 220021110111.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1110111200196 and 1110111200205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19529605 + ... + 19586364.
It is an arithmetic number, because the mean of its divisors is an integer number (36143156280).
Almost surely, 21110111200220 is an apocalyptic number.
1110111200220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1110111200220 is an abundant number, since it is smaller than the sum of its proper divisors (2359631802660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110111200220 is a wasteful number, since it uses less digits than its factorization.
1110111200220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39116035 (or 39116033 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1110111200220 its reverse (220021110111), we get a palindrome (1330132310331).
The spelling of 1110111200220 in words is "one trillion, one hundred ten billion, one hundred eleven million, two hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •