Base | Representation |
---|---|
bin | 11001011110000110110001… |
… | …101000000100111100010100 |
3 | 112200122000020221112201120000 |
4 | 121132012301220010330110 |
5 | 104140314001130321322 |
6 | 1034125142052211300 |
7 | 32411115401321133 |
oct | 3136066150047424 |
9 | 480560227481500 |
10 | 112020022120212 |
11 | 32769474149268 |
12 | 10692292909b30 |
13 | 4a6759a98692b |
14 | 1d93b259d391a |
15 | ce3d7037a3ac |
hex | 65e1b1a04f14 |
112020022120212 has 60 divisors (see below), whose sum is σ = 302288996397696. Its totient is φ = 36135491003280.
The previous prime is 112020022120183. The next prime is 112020022120231. The reversal of 112020022120212 is 212021220020211.
It is a happy number.
112020022120212 is a `hidden beast` number, since 1 + 12 + 0 + 200 + 221 + 20 + 212 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 5576454618 + ... + 5576474705.
Almost surely, 2112020022120212 is an apocalyptic number.
112020022120212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112020022120212 is an abundant number, since it is smaller than the sum of its proper divisors (190268974277484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112020022120212 is a wasteful number, since it uses less digits than its factorization.
112020022120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11152929370 (or 11152929359 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 112020022120212 its reverse (212021220020211), we get a palindrome (324041242140423).
The spelling of 112020022120212 in words is "one hundred twelve trillion, twenty billion, twenty-two million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •