Base | Representation |
---|---|
bin | 11001011111100101110101… |
… | …111100110000001000001001 |
3 | 112200222202201221022111112101 |
4 | 121133211311330300020021 |
5 | 104144002030112401441 |
6 | 1034244103130113401 |
7 | 32421361110113215 |
oct | 3137456574601011 |
9 | 480882657274471 |
10 | 112122100122121 |
11 | 327a8796557a11 |
12 | 106aa02057b861 |
13 | 4a740b7b514ab |
14 | 1d98a4aa15945 |
15 | ce6846c34231 |
hex | 65f975f30209 |
112122100122121 has 16 divisors (see below), whose sum is σ = 114572994681600. Its totient is φ = 109673933777280.
The previous prime is 112122100122041. The next prime is 112122100122143. The reversal of 112122100122121 is 121221001221211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 112122100122121 - 29 = 112122100121609 is a prime.
It is a super-2 number, since 2×1121221001221212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112122100122161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2985048181 + ... + 2985085741.
It is an arithmetic number, because the mean of its divisors is an integer number (7160812167600).
Almost surely, 2112122100122121 is an apocalyptic number.
It is an amenable number.
112122100122121 is a deficient number, since it is larger than the sum of its proper divisors (2450894559479).
112122100122121 is a wasteful number, since it uses less digits than its factorization.
112122100122121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72144.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 112122100122121 its reverse (121221001221211), we get a palindrome (233343101343332).
The spelling of 112122100122121 in words is "one hundred twelve trillion, one hundred twenty-two billion, one hundred million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •