Base | Representation |
---|---|
bin | 11001100000101110100000… |
… | …010111001111010100010100 |
3 | 112201021020010100120212000020 |
4 | 121200232200113033110110 |
5 | 104201241322001320040 |
6 | 1034344005110545140 |
7 | 32430122411466333 |
oct | 3140564027172424 |
9 | 481236110525006 |
10 | 112200121120020 |
11 | 3282889335946a |
12 | 107011756681b0 |
13 | 4a7b56cc8163b |
14 | 1d9c72c9ddd1a |
15 | ce88b15dbcd0 |
hex | 660ba05cf514 |
112200121120020 has 24 divisors (see below), whose sum is σ = 314160339136224. Its totient is φ = 29920032298656.
The previous prime is 112200121120013. The next prime is 112200121120063. The reversal of 112200121120020 is 20021121002211.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 935001009274 + ... + 935001009393.
It is an arithmetic number, because the mean of its divisors is an integer number (13090014130676).
Almost surely, 2112200121120020 is an apocalyptic number.
112200121120020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112200121120020 is an abundant number, since it is smaller than the sum of its proper divisors (201960218016204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112200121120020 is a wasteful number, since it uses less digits than its factorization.
112200121120020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1870002018679 (or 1870002018677 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112200121120020 its reverse (20021121002211), we get a palindrome (132221242122231).
The spelling of 112200121120020 in words is "one hundred twelve trillion, two hundred billion, one hundred twenty-one million, one hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •