Base | Representation |
---|---|
bin | 110111000011110001… |
… | …0111011000000100101 |
3 | 102022012020000200102011 |
4 | 1232013202323000211 |
5 | 3414122434230444 |
6 | 130152354514221 |
7 | 11354024036602 |
oct | 1560742730045 |
9 | 368166020364 |
10 | 118238195749 |
11 | 46165419553 |
12 | 1aab9895971 |
13 | b1c41ab84b |
14 | 5a193736a9 |
15 | 3120494734 |
hex | 1b878bb025 |
118238195749 has 4 divisors (see below), whose sum is σ = 118246976064. Its totient is φ = 118229415436.
The previous prime is 118238195741. The next prime is 118238195809. The reversal of 118238195749 is 947591832811.
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 an emirpimes, since its reverse is a distinct semiprime: 947591832811 = 13 ⋅72891679447.
It is a cyclic number.
It is not a de Polignac number, because 118238195749 - 23 = 118238195741 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 118238195693 and 118238195702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (118238195741) 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, 4369927 + ... + 4396900.
It is an arithmetic number, because the mean of its divisors is an integer number (29561744016).
Almost surely, 2118238195749 is an apocalyptic number.
It is an amenable number.
118238195749 is a deficient number, since it is larger than the sum of its proper divisors (8780315).
118238195749 is an equidigital number, since it uses as much as digits as its factorization.
118238195749 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8780314.
The product of its digits is 4354560, while the sum is 58.
The spelling of 118238195749 in words is "one hundred eighteen billion, two hundred thirty-eight million, one hundred ninety-five thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •