Base | Representation |
---|---|
bin | 11001011101110100010100… |
… | …110011000111010000110001 |
3 | 112200120010010021122200220220 |
4 | 121131310110303013100301 |
5 | 104140002413021334301 |
6 | 1034112104153523253 |
7 | 32406514432521414 |
oct | 3135642463072061 |
9 | 480503107580826 |
10 | 112000211121201 |
11 | 3276102837a507 |
12 | 1068a484113529 |
13 | 4a657614b4b00 |
14 | 1d92ba6869b7b |
15 | ce35b0ee4936 |
hex | 65dd14cc7431 |
112000211121201 has 12 divisors (see below), whose sum is σ = 161704446826608. Its totient is φ = 68923206843504.
The previous prime is 112000211121103. The next prime is 112000211121203. The reversal of 112000211121201 is 102121112000211.
It is a happy number.
It is not a de Polignac number, because 112000211121201 - 219 = 112000210596913 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (112000211121203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 110453856615 + ... + 110453857628.
It is an arithmetic number, because the mean of its divisors is an integer number (13475370568884).
Almost surely, 2112000211121201 is an apocalyptic number.
It is an amenable number.
112000211121201 is a deficient number, since it is larger than the sum of its proper divisors (49704235705407).
112000211121201 is a wasteful number, since it uses less digits than its factorization.
112000211121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220907714272 (or 220907714259 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112000211121201 its reverse (102121112000211), we get a palindrome (214121323121412).
The spelling of 112000211121201 in words is "one hundred twelve trillion, two hundred eleven million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •