Base | Representation |
---|---|
bin | 110100011010110010… |
… | …1101111001100100101 |
3 | 101202120001222211012002 |
4 | 1220311211233030211 |
5 | 3321014432003124 |
6 | 123414011535045 |
7 | 11063355131303 |
oct | 1506545571445 |
9 | 352501884162 |
10 | 112568234789 |
11 | 438159199aa |
12 | 19996a5a485 |
13 | a7cc5ca56a |
14 | 563c317273 |
15 | 2ddc8010ae |
hex | 1a3596f325 |
112568234789 has 4 divisors (see below), whose sum is σ = 112568905824. Its totient is φ = 112567563756.
The previous prime is 112568234783. The next prime is 112568234833. The reversal of 112568234789 is 987432865211.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112568234789 is a prime.
It is a super-2 number, since 2×1125682347892 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112568234783) 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, 164984 + ... + 502350.
It is an arithmetic number, because the mean of its divisors is an integer number (28142226456).
Almost surely, 2112568234789 is an apocalyptic number.
It is an amenable number.
112568234789 is a deficient number, since it is larger than the sum of its proper divisors (671035).
112568234789 is an equidigital number, since it uses as much as digits as its factorization.
112568234789 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 671034.
The product of its digits is 5806080, while the sum is 56.
The spelling of 112568234789 in words is "one hundred twelve billion, five hundred sixty-eight million, two hundred thirty-four thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •