Base | Representation |
---|---|
bin | 10000001011110100111… |
… | …100010011101001111100 |
3 | 10221022210220020110102121 |
4 | 100023310330103221330 |
5 | 121210302004342340 |
6 | 2210535341532324 |
7 | 143232424422160 |
oct | 20136474235174 |
9 | 3838726213377 |
10 | 1112211012220 |
11 | 399760137230 |
12 | 15b6792740a4 |
13 | 80b5b8815a9 |
14 | 3bb8d132ca0 |
15 | 1dde7a0394a |
hex | 102f4f13a7c |
1112211012220 has 96 divisors (see below), whose sum is σ = 2940802454016. Its totient is φ = 343230816000.
The previous prime is 1112211012151. The next prime is 1112211012223. The reversal of 1112211012220 is 222101122111.
It is a junction number, because it is equal to n+sod(n) for n = 1112211012194 and 1112211012203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112211012223) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3419782 + ... + 3730861.
It is an arithmetic number, because the mean of its divisors is an integer number (30633358896).
Almost surely, 21112211012220 is an apocalyptic number.
1112211012220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1112211012220 is an abundant number, since it is smaller than the sum of its proper divisors (1828591441796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112211012220 is a wasteful number, since it uses less digits than its factorization.
1112211012220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7150771 (or 7150769 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1112211012220 its reverse (222101122111), we get a palindrome (1334312134331).
The spelling of 1112211012220 in words is "one trillion, one hundred twelve billion, two hundred eleven million, twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •