Base | Representation |
---|---|
bin | 11001011111100101101111… |
… | …111111001101001100111001 |
3 | 112200222202110222002221222220 |
4 | 121133211233333031030321 |
5 | 104144001324011232301 |
6 | 1034244045154234253 |
7 | 32421355454006025 |
oct | 3137455777151471 |
9 | 480882428087886 |
10 | 112122000102201 |
11 | 327a8745052521 |
12 | 106a9bb2b85989 |
13 | 4a740a02018cb |
14 | 1d98a3b61b385 |
15 | ce683d078936 |
hex | 65f96ffcd339 |
112122000102201 has 32 divisors (see below), whose sum is σ = 152690585534208. Its totient is φ = 73166591796480.
The previous prime is 112122000102107. The next prime is 112122000102209. The reversal of 112122000102201 is 102201000221211.
It is not a de Polignac number, because 112122000102201 - 29 = 112122000101689 is a prime.
It is a super-2 number, since 2×1121220001022012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112122000102209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40011291 + ... + 42721743.
It is an arithmetic number, because the mean of its divisors is an integer number (4771580797944).
Almost surely, 2112122000102201 is an apocalyptic number.
It is an amenable number.
112122000102201 is a deficient number, since it is larger than the sum of its proper divisors (40568585432007).
112122000102201 is a wasteful number, since it uses less digits than its factorization.
112122000102201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2711921.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112122000102201 its reverse (102201000221211), we get a palindrome (214323000323412).
The spelling of 112122000102201 in words is "one hundred twelve trillion, one hundred twenty-two billion, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •