Base | Representation |
---|---|
bin | 110100100010001100… |
… | …0100100000111110101 |
3 | 101210012101000221110011 |
4 | 1221010120210013311 |
5 | 3322022002033142 |
6 | 123454355500221 |
7 | 11102460626125 |
oct | 1510430440765 |
9 | 353171027404 |
10 | 112816439797 |
11 | 43932a37006 |
12 | 19a45bb7671 |
13 | a83bb61c29 |
14 | 5663286c85 |
15 | 2e044cd417 |
hex | 1a446241f5 |
112816439797 has 4 divisors (see below), whose sum is σ = 112817399680. Its totient is φ = 112815479916.
The previous prime is 112816439789. The next prime is 112816439863. The reversal of 112816439797 is 797934618211.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 797934618211 = 17 ⋅46937330483.
It is a cyclic number.
It is not a de Polignac number, because 112816439797 - 23 = 112816439789 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 (112816431797) 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, 274263 + ... + 548500.
It is an arithmetic number, because the mean of its divisors is an integer number (28204349920).
Almost surely, 2112816439797 is an apocalyptic number.
It is an amenable number.
112816439797 is a deficient number, since it is larger than the sum of its proper divisors (959883).
112816439797 is an equidigital number, since it uses as much as digits as its factorization.
112816439797 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 959882.
The product of its digits is 4572288, while the sum is 58.
The spelling of 112816439797 in words is "one hundred twelve billion, eight hundred sixteen million, four hundred thirty-nine thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •