Base | Representation |
---|---|
bin | 110100010101110111… |
… | …0100000011000110111 |
3 | 101202010112121220012021 |
4 | 1220223232200120313 |
5 | 3320200101330041 |
6 | 123345341134011 |
7 | 11056305464233 |
oct | 1505356403067 |
9 | 352115556167 |
10 | 112402761271 |
11 | 43740479229 |
12 | 1994b55a307 |
13 | a7a4241638 |
14 | 56243615c3 |
15 | 2dcd016cd1 |
hex | 1a2bba0637 |
112402761271 has 4 divisors (see below), whose sum is σ = 117289837872. Its totient is φ = 107515684672.
The previous prime is 112402761253. The next prime is 112402761281. The reversal of 112402761271 is 172167204211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 172167204211 = 31 ⋅5553780781.
It is a cyclic number.
It is not a de Polignac number, because 112402761271 - 29 = 112402760759 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112402761221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2443538266 + ... + 2443538311.
It is an arithmetic number, because the mean of its divisors is an integer number (29322459468).
Almost surely, 2112402761271 is an apocalyptic number.
112402761271 is a deficient number, since it is larger than the sum of its proper divisors (4887076601).
112402761271 is an equidigital number, since it uses as much as digits as its factorization.
112402761271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4887076600.
The product of its (nonzero) digits is 9408, while the sum is 34.
Adding to 112402761271 its reverse (172167204211), we get a palindrome (284569965482).
The spelling of 112402761271 in words is "one hundred twelve billion, four hundred two million, seven hundred sixty-one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •