Base | Representation |
---|---|
bin | 110100001001111011… |
… | …0100001100101000001 |
3 | 101201002121220210022012 |
4 | 1220103312201211001 |
5 | 3313340031210423 |
6 | 123241512022305 |
7 | 11043343035503 |
oct | 1502366414501 |
9 | 351077823265 |
10 | 112002210113 |
11 | 43555367212 |
12 | 19859391995 |
13 | a73c269211 |
14 | 55c7095d73 |
15 | 2da7c95078 |
hex | 1a13da1941 |
112002210113 has 4 divisors (see below), whose sum is σ = 112993380228. Its totient is φ = 111011040000.
The previous prime is 112002210079. The next prime is 112002210119. The reversal of 112002210113 is 311012200211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 311012200211 = 19 ⋅16369063169.
It can be written as a sum of positive squares in 2 ways, for example, as 58744186384 + 53258023729 = 242372^2 + 230777^2 .
It is a cyclic number.
It is not a de Polignac number, because 112002210113 - 216 = 112002144577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112002210119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 495584888 + ... + 495585113.
It is an arithmetic number, because the mean of its divisors is an integer number (28248345057).
Almost surely, 2112002210113 is an apocalyptic number.
It is an amenable number.
112002210113 is a deficient number, since it is larger than the sum of its proper divisors (991170115).
112002210113 is an equidigital number, since it uses as much as digits as its factorization.
112002210113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 991170114.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 112002210113 its reverse (311012200211), we get a palindrome (423014410324).
The spelling of 112002210113 in words is "one hundred twelve billion, two million, two hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •