Base | Representation |
---|---|
bin | 1101111100110… |
… | …00001111101101 |
3 | 22011012000010122 |
4 | 12332120033231 |
5 | 214423444113 |
6 | 15340014325 |
7 | 2620421105 |
oct | 676301755 |
9 | 264160118 |
10 | 117015533 |
11 | 60063558 |
12 | 332313a5 |
13 | 1b32067b |
14 | 11780205 |
15 | a416408 |
hex | 6f983ed |
117015533 has 4 divisors (see below), whose sum is σ = 118089180. Its totient is φ = 115941888.
The previous prime is 117015529. The next prime is 117015541. The reversal of 117015533 is 335510711.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 335510711 = 2273 ⋅147607.
It can be written as a sum of positive squares in 2 ways, for example, as 44049769 + 72965764 = 6637^2 + 8542^2 .
It is a cyclic number.
It is not a de Polignac number, because 117015533 - 22 = 117015529 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 (117015553) 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, 536660 + ... + 536877.
It is an arithmetic number, because the mean of its divisors is an integer number (29522295).
Almost surely, 2117015533 is an apocalyptic number.
It is an amenable number.
117015533 is a deficient number, since it is larger than the sum of its proper divisors (1073647).
117015533 is a wasteful number, since it uses less digits than its factorization.
117015533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1073646.
The product of its (nonzero) digits is 1575, while the sum is 26.
The square root of 117015533 is about 10817.3718157416. The cubic root of 117015533 is about 489.1189679915.
The spelling of 117015533 in words is "one hundred seventeen million, fifteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •