Base | Representation |
---|---|
bin | 11001011101110100001001… |
… | …011110101101001001110000 |
3 | 112200120002122001022211012011 |
4 | 121131310021132231021300 |
5 | 104140002020413101000 |
6 | 1034112033251412304 |
7 | 32406506635433422 |
oct | 3135641136551160 |
9 | 480502561284164 |
10 | 112000021222000 |
11 | 32760a4016641a |
12 | 1068a4305b4094 |
13 | 4a65731056212 |
14 | 1d92b89556812 |
15 | ce359e4d32ba |
hex | 65dd097ad270 |
112000021222000 has 80 divisors (see below), whose sum is σ = 271845771417792. Its totient is φ = 44629666041600.
The previous prime is 112000021221967. The next prime is 112000021222013. The reversal of 112000021222000 is 222120000211.
It is a happy number.
112000021222000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 105937899 + ... + 106989898.
Almost surely, 2112000021222000 is an apocalyptic number.
112000021222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112000021222000 is an abundant number, since it is smaller than the sum of its proper divisors (159845750195792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112000021222000 is a wasteful number, since it uses less digits than its factorization.
112000021222000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212928083 (or 212928067 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 112000021222000 its reverse (222120000211), we get a palindrome (112222141222211).
The spelling of 112000021222000 in words is "one hundred twelve trillion, twenty-one million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •