Base | Representation |
---|---|
bin | 110100001111000011… |
… | …0111110010000111001 |
3 | 101201112121201120010012 |
4 | 1220132012332100321 |
5 | 3314213104402243 |
6 | 123310540231305 |
7 | 11050532524142 |
oct | 1503606762071 |
9 | 351477646105 |
10 | 112174294073 |
11 | 43633512466 |
12 | 198a6b3b535 |
13 | a768acac4a |
14 | 5601c8cac9 |
15 | 2db7e37d18 |
hex | 1a1e1be439 |
112174294073 has 4 divisors (see below), whose sum is σ = 112497563280. Its totient is φ = 111851024868.
The previous prime is 112174294069. The next prime is 112174294093. The reversal of 112174294073 is 370492471211.
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.
It is a cyclic number.
It is not a de Polignac number, because 112174294073 - 22 = 112174294069 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112174294073.
It is not an unprimeable number, because it can be changed into a prime (112174294093) 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, 161634083 + ... + 161634776.
It is an arithmetic number, because the mean of its divisors is an integer number (28124390820).
Almost surely, 2112174294073 is an apocalyptic number.
It is an amenable number.
112174294073 is a deficient number, since it is larger than the sum of its proper divisors (323269207).
112174294073 is an equidigital number, since it uses as much as digits as its factorization.
112174294073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323269206.
The product of its (nonzero) digits is 84672, while the sum is 41.
The spelling of 112174294073 in words is "one hundred twelve billion, one hundred seventy-four million, two hundred ninety-four thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •