Base | Representation |
---|---|
bin | 1101111111001… |
… | …00111011000101 |
3 | 22011202221221221 |
4 | 12333210323011 |
5 | 220014021410 |
6 | 15350440341 |
7 | 2623166551 |
oct | 677447305 |
9 | 264687857 |
10 | 117329605 |
11 | 60258518 |
12 | 333630b1 |
13 | 1b400603 |
14 | 11822861 |
15 | a4794da |
hex | 6fe4ec5 |
117329605 has 4 divisors (see below), whose sum is σ = 140795532. Its totient is φ = 93863680.
The previous prime is 117329587. The next prime is 117329609. The reversal of 117329605 is 506923711.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 506923711 = 7 ⋅72417673.
It can be written as a sum of positive squares in 2 ways, for example, as 43678881 + 73650724 = 6609^2 + 8582^2 .
It is not a de Polignac number, because 117329605 - 25 = 117329573 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117329609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11732956 + ... + 11732965.
It is an arithmetic number, because the mean of its divisors is an integer number (35198883).
Almost surely, 2117329605 is an apocalyptic number.
It is an amenable number.
117329605 is a deficient number, since it is larger than the sum of its proper divisors (23465927).
117329605 is an equidigital number, since it uses as much as digits as its factorization.
117329605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23465926.
The product of its (nonzero) digits is 11340, while the sum is 34.
The square root of 117329605 is about 10831.8791075233. The cubic root of 117329605 is about 489.5561787182.
The spelling of 117329605 in words is "one hundred seventeen million, three hundred twenty-nine thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •