Base | Representation |
---|---|
bin | 110100001001111011… |
… | …0011111011000011000 |
3 | 101201002121220022221211 |
4 | 1220103312133120120 |
5 | 3313340030413422 |
6 | 123241511512504 |
7 | 11043343000324 |
oct | 1502366373030 |
9 | 351077808854 |
10 | 112002201112 |
11 | 4355536047a |
12 | 19859388734 |
13 | a73c2650a9 |
14 | 55c7092984 |
15 | 2da7c92577 |
hex | 1a13d9f618 |
112002201112 has 32 divisors (see below), whose sum is σ = 211561690320. Its totient is φ = 55586494080.
The previous prime is 112002201083. The next prime is 112002201127. The reversal of 112002201112 is 211102200211.
It is a junction number, because it is equal to n+sod(n) for n = 112002201092 and 112002201101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1173658 + ... + 1265494.
Almost surely, 2112002201112 is an apocalyptic number.
It is an amenable number.
112002201112 is a deficient number, since it is larger than the sum of its proper divisors (99559489208).
112002201112 is a wasteful number, since it uses less digits than its factorization.
112002201112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92971 (or 92967 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112002201112 its reverse (211102200211), we get a palindrome (323104401323).
Subtracting 112002201112 from its reverse (211102200211), we obtain a palindrome (99099999099).
The spelling of 112002201112 in words is "one hundred twelve billion, two million, two hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •