Base | Representation |
---|---|
bin | 110110100000011000… |
… | …0110110110010011101 |
3 | 102012010110110221001002 |
4 | 1231000300312302131 |
5 | 3404204432304031 |
6 | 125434454000045 |
7 | 11312424150263 |
oct | 1550060666235 |
9 | 365113427032 |
10 | 117050666141 |
11 | 4570605aa22 |
12 | 1a828046025 |
13 | b0651624c6 |
14 | 594576c433 |
15 | 30a10bdccb |
hex | 1b40c36c9d |
117050666141 has 4 divisors (see below), whose sum is σ = 117317296800. Its totient is φ = 116784035484.
The previous prime is 117050666111. The next prime is 117050666149. The reversal of 117050666141 is 141666050711.
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: 141666050711 = 139907 ⋅1012573.
It is a cyclic number.
It is not a de Polignac number, because 117050666141 - 218 = 117050403997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 117050666095 and 117050666104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117050666149) 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, 133314671 + ... + 133315548.
It is an arithmetic number, because the mean of its divisors is an integer number (29329324200).
Almost surely, 2117050666141 is an apocalyptic number.
It is an amenable number.
117050666141 is a deficient number, since it is larger than the sum of its proper divisors (266630659).
117050666141 is an equidigital number, since it uses as much as digits as its factorization.
117050666141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266630658.
The product of its (nonzero) digits is 30240, while the sum is 38.
The spelling of 117050666141 in words is "one hundred seventeen billion, fifty million, six hundred sixty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •