Base | Representation |
---|---|
bin | 110100001010100001… |
… | …0110010011100000001 |
3 | 101201011000112111011122 |
4 | 1220111002302130001 |
5 | 3313410140431423 |
6 | 123243504322025 |
7 | 11044005002303 |
oct | 1502502623401 |
9 | 351130474148 |
10 | 112022202113 |
11 | 43565681528 |
12 | 19864013315 |
13 | a743448ac3 |
14 | 55c99bb973 |
15 | 2da98e38c8 |
hex | 1a150b2701 |
112022202113 has 8 divisors (see below), whose sum is σ = 118325028096. Its totient is φ = 105887451600.
The previous prime is 112022202107. The next prime is 112022202157. The reversal of 112022202113 is 311202220211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112022202113 - 28 = 112022201857 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112022202091 and 112022202100.
It is not an unprimeable number, because it can be changed into a prime (112022204113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42017498 + ... + 42020163.
It is an arithmetic number, because the mean of its divisors is an integer number (14790628512).
Almost surely, 2112022202113 is an apocalyptic number.
It is an amenable number.
112022202113 is a deficient number, since it is larger than the sum of its proper divisors (6302825983).
112022202113 is an equidigital number, since it uses as much as digits as its factorization.
112022202113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84037735.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 112022202113 its reverse (311202220211), we get a palindrome (423224422324).
It can be divided in two parts, 11202220211 and 3, that multiplied together give a palindrome (33606660633).
The spelling of 112022202113 in words is "one hundred twelve billion, twenty-two million, two hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •