Base | Representation |
---|---|
bin | 11001011111010001011101… |
… | …010000011101010011011100 |
3 | 112200220200020110002221202012 |
4 | 121133101131100131103130 |
5 | 104143122213010133040 |
6 | 1034230043114450352 |
7 | 32416654505612015 |
oct | 3137213520352334 |
9 | 480820213087665 |
10 | 112100211021020 |
11 | 3279a483747312 |
12 | 106a5931a339b8 |
13 | 4a72009c8aa71 |
14 | 1d979718a200c |
15 | ce5eb520e865 |
hex | 65f45d41d4dc |
112100211021020 has 24 divisors (see below), whose sum is σ = 249258116271024. Its totient is φ = 42202432384256.
The previous prime is 112100211020977. The next prime is 112100211021047. The reversal of 112100211021020 is 20120112001211.
It is a junction number, because it is equal to n+sod(n) for n = 112100211020986 and 112100211021004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164853251162 + ... + 164853251841.
It is an arithmetic number, because the mean of its divisors is an integer number (10385754844626).
Almost surely, 2112100211021020 is an apocalyptic number.
112100211021020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112100211021020 is an abundant number, since it is smaller than the sum of its proper divisors (137157905250004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112100211021020 is a wasteful number, since it uses less digits than its factorization.
112100211021020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329706503029 (or 329706503027 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112100211021020 its reverse (20120112001211), we get a palindrome (132220323022231).
The spelling of 112100211021020 in words is "one hundred twelve trillion, one hundred billion, two hundred eleven million, twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •