Base | Representation |
---|---|
bin | 110100001011111110… |
… | …0111100111110000001 |
3 | 101201021102100212211011 |
4 | 1220113330330332001 |
5 | 3314010134112113 |
6 | 123252410320521 |
7 | 11045136550042 |
oct | 1502774747601 |
9 | 351242325734 |
10 | 112071004033 |
11 | 4359018409a |
12 | 19878429141 |
13 | a7505a4a91 |
14 | 55d22828c9 |
15 | 2dadd3363d |
hex | 1a17f3cf81 |
112071004033 has 4 divisors (see below), whose sum is σ = 112536029188. Its totient is φ = 111605978880.
The previous prime is 112071003977. The next prime is 112071004039. The reversal of 112071004033 is 330400170211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 54089735184 + 57981268849 = 232572^2 + 240793^2 .
It is a cyclic number.
It is not a de Polignac number, because 112071004033 - 233 = 103481069441 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112071003995 and 112071004013.
It is not an unprimeable number, because it can be changed into a prime (112071004039) 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, 232512216 + ... + 232512697.
It is an arithmetic number, because the mean of its divisors is an integer number (28134007297).
Almost surely, 2112071004033 is an apocalyptic number.
It is an amenable number.
112071004033 is a deficient number, since it is larger than the sum of its proper divisors (465025155).
112071004033 is an equidigital number, since it uses as much as digits as its factorization.
112071004033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465025154.
The product of its (nonzero) digits is 504, while the sum is 22.
Adding to 112071004033 its reverse (330400170211), we get a palindrome (442471174244).
The spelling of 112071004033 in words is "one hundred twelve billion, seventy-one million, four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •