Base | Representation |
---|---|
bin | 110100010010101010… |
… | …0010010100110011101 |
3 | 101201212001021112012110 |
4 | 1220211110102212131 |
5 | 3314440034211012 |
6 | 123330540224233 |
7 | 11053531445511 |
oct | 1504524224635 |
9 | 351761245173 |
10 | 112295225757 |
11 | 43695800200 |
12 | 1991b53b079 |
13 | a787b8cc60 |
14 | 5613d6c141 |
15 | 2dc387473c |
hex | 1a2551299d |
112295225757 has 48 divisors (see below), whose sum is σ = 177500199744. Its totient is φ = 62728723200.
The previous prime is 112295225743. The next prime is 112295225767. The reversal of 112295225757 is 757522592211.
It is not a de Polignac number, because 112295225757 - 27 = 112295225629 is a prime.
It is a super-2 number, since 2×1122952257572 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112295225767) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3205657 + ... + 3240497.
It is an arithmetic number, because the mean of its divisors is an integer number (3697920828).
Almost surely, 2112295225757 is an apocalyptic number.
It is an amenable number.
112295225757 is a deficient number, since it is larger than the sum of its proper divisors (65204973987).
112295225757 is a wasteful number, since it uses less digits than its factorization.
112295225757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35562 (or 35551 counting only the distinct ones).
The product of its digits is 882000, while the sum is 48.
The spelling of 112295225757 in words is "one hundred twelve billion, two hundred ninety-five million, two hundred twenty-five thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •