Base | Representation |
---|---|
bin | 110110100001011101… |
… | …0011010101010110001 |
3 | 102012012222100000000021 |
4 | 1231002322122222301 |
5 | 3404243200224313 |
6 | 125442222523441 |
7 | 11313342520426 |
oct | 1550272325261 |
9 | 365188300007 |
10 | 117086726833 |
11 | 4572444a94a |
12 | 1a838136581 |
13 | b06c779cab |
14 | 594a477d4d |
15 | 30a434378d |
hex | 1b42e9aab1 |
117086726833 has 4 divisors (see below), whose sum is σ = 123249186160. Its totient is φ = 110924267508.
The previous prime is 117086726821. The next prime is 117086726839. The reversal of 117086726833 is 338627680711.
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: 338627680711 = 62483 ⋅5419517.
It is a cyclic number.
It is not a de Polignac number, because 117086726833 - 217 = 117086595761 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (117086726839) 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, 3081229635 + ... + 3081229672.
It is an arithmetic number, because the mean of its divisors is an integer number (30812296540).
Almost surely, 2117086726833 is an apocalyptic number.
It is an amenable number.
117086726833 is a deficient number, since it is larger than the sum of its proper divisors (6162459327).
117086726833 is an equidigital number, since it uses as much as digits as its factorization.
117086726833 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6162459326.
The product of its (nonzero) digits is 2032128, while the sum is 52.
The spelling of 117086726833 in words is "one hundred seventeen billion, eighty-six million, seven hundred twenty-six thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •