Base | Representation |
---|---|
bin | 1101111110101… |
… | …01101010011111 |
3 | 22011122210020001 |
4 | 12333111222133 |
5 | 220010021403 |
6 | 15345235131 |
7 | 2622516412 |
oct | 677255237 |
9 | 264583201 |
10 | 117267103 |
11 | 60215568 |
12 | 33332aa7 |
13 | 1b3ab025 |
14 | 11807b79 |
15 | a465c1d |
hex | 6fd5a9f |
117267103 has 4 divisors (see below), whose sum is σ = 117323968. Its totient is φ = 117210240.
The previous prime is 117267091. The next prime is 117267113. The reversal of 117267103 is 301762711.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301762711 = 31 ⋅9734281.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-117267103 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 (117267113) 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, 25218 + ... + 29503.
It is an arithmetic number, because the mean of its divisors is an integer number (29330992).
Almost surely, 2117267103 is an apocalyptic number.
117267103 is a deficient number, since it is larger than the sum of its proper divisors (56865).
117267103 is an equidigital number, since it uses as much as digits as its factorization.
117267103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56864.
The product of its (nonzero) digits is 1764, while the sum is 28.
The square root of 117267103 is about 10828.9936282186. The cubic root of 117267103 is about 489.4692336965.
It can be divided in two parts, 117267 and 103, that added together give a triangular number (117370 = T484).
The spelling of 117267103 in words is "one hundred seventeen million, two hundred sixty-seven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •