Base | Representation |
---|---|
bin | 110110110011000000… |
… | …1001010011011110011 |
3 | 102020202000120211102202 |
4 | 1231212001022123303 |
5 | 3411444434313112 |
6 | 130020502333415 |
7 | 11334053633315 |
oct | 1554601123363 |
9 | 366660524382 |
10 | 117675697907 |
11 | 459a69555a9 |
12 | 1a98142a26b |
13 | b1347b38a1 |
14 | 59a478d7b5 |
15 | 30dadd36c2 |
hex | 1b6604a6f3 |
117675697907 has 4 divisors (see below), whose sum is σ = 117688600176. Its totient is φ = 117662795640.
The previous prime is 117675697903. The next prime is 117675697913. The reversal of 117675697907 is 709796576711.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 709796576711 = 5381 ⋅131907931.
It is a cyclic number.
It is not a de Polignac number, because 117675697907 - 22 = 117675697903 is a prime.
It is a super-3 number, since 3×1176756979073 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (117675697903) 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, 6437444 + ... + 6455697.
It is an arithmetic number, because the mean of its divisors is an integer number (29422150044).
Almost surely, 2117675697907 is an apocalyptic number.
117675697907 is a deficient number, since it is larger than the sum of its proper divisors (12902269).
117675697907 is an equidigital number, since it uses as much as digits as its factorization.
117675697907 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12902268.
The product of its (nonzero) digits is 35006580, while the sum is 65.
The spelling of 117675697907 in words is "one hundred seventeen billion, six hundred seventy-five million, six hundred ninety-seven thousand, nine hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •