Base | Representation |
---|---|
bin | 110100100101111100… |
… | …0000010011000111101 |
3 | 101210112010112201000121 |
4 | 1221023320002120331 |
5 | 3322301141140444 |
6 | 123515045454541 |
7 | 11105545162060 |
oct | 1511370023075 |
9 | 353463481017 |
10 | 112942130749 |
11 | 43997985528 |
12 | 19a80111451 |
13 | a85bbcc286 |
14 | 5675c448d7 |
15 | 2e1055a084 |
hex | 1a4be0263d |
112942130749 has 8 divisors (see below), whose sum is σ = 135870232640. Its totient is φ = 91712406816.
The previous prime is 112942130701. The next prime is 112942130837. The reversal of 112942130749 is 947031249211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112942130749 - 27 = 112942130621 is a prime.
It is a super-2 number, since 2×1129421307492 (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 (112942130549) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 424594344 + ... + 424594609.
It is an arithmetic number, because the mean of its divisors is an integer number (16983779080).
Almost surely, 2112942130749 is an apocalyptic number.
112942130749 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
112942130749 is a deficient number, since it is larger than the sum of its proper divisors (22928101891).
112942130749 is an equidigital number, since it uses as much as digits as its factorization.
112942130749 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 849188979.
The product of its (nonzero) digits is 108864, while the sum is 43.
The spelling of 112942130749 in words is "one hundred twelve billion, nine hundred forty-two million, one hundred thirty thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •