Base | Representation |
---|---|
bin | 1101111110101… |
… | …11011011000001 |
3 | 22011200011002210 |
4 | 12333113123001 |
5 | 220010234210 |
6 | 15345332333 |
7 | 2622546411 |
oct | 677273301 |
9 | 264604083 |
10 | 117274305 |
11 | 6021aa15 |
12 | 333370a9 |
13 | 1b3b13a5 |
14 | 1180a641 |
15 | a467e20 |
hex | 6fd76c1 |
117274305 has 8 divisors (see below), whose sum is σ = 187638912. Its totient is φ = 62546288.
The previous prime is 117274303. The next prime is 117274331. The reversal of 117274305 is 503472711.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 117274305 - 21 = 117274303 is a prime.
It is a super-2 number, since 2×1172743052 = 27506525226466050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (117274303) 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 7 ways as a sum of consecutive naturals, for example, 3909129 + ... + 3909158.
It is an arithmetic number, because the mean of its divisors is an integer number (23454864).
Almost surely, 2117274305 is an apocalyptic number.
117274305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
117274305 is a deficient number, since it is larger than the sum of its proper divisors (70364607).
117274305 is an equidigital number, since it uses as much as digits as its factorization.
117274305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7818295.
The product of its (nonzero) digits is 5880, while the sum is 30.
The square root of 117274305 is about 10829.3261563220. The cubic root of 117274305 is about 489.4792537993.
The spelling of 117274305 in words is "one hundred seventeen million, two hundred seventy-four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •