Base | Representation |
---|---|
bin | 1110000000011… |
… | …11100000110001 |
3 | 22012002211020211 |
4 | 13000033200301 |
5 | 220040112144 |
6 | 15354304121 |
7 | 2624524255 |
oct | 700174061 |
9 | 265084224 |
10 | 117504049 |
11 | 60367593 |
12 | 33428041 |
13 | 1b461b30 |
14 | 1186a265 |
15 | a4b1034 |
hex | 700f831 |
117504049 has 4 divisors (see below), whose sum is σ = 126542836. Its totient is φ = 108465264.
The previous prime is 117504029. The next prime is 117504059. The reversal of 117504049 is 940405711.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 22733824 + 94770225 = 4768^2 + 9735^2 .
It is a cyclic number.
It is not a de Polignac number, because 117504049 - 211 = 117502001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 117504049.
It is not an unprimeable number, because it can be changed into a prime (117504029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4519374 + ... + 4519399.
It is an arithmetic number, because the mean of its divisors is an integer number (31635709).
Almost surely, 2117504049 is an apocalyptic number.
It is an amenable number.
117504049 is a deficient number, since it is larger than the sum of its proper divisors (9038787).
117504049 is an equidigital number, since it uses as much as digits as its factorization.
117504049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9038786.
The product of its (nonzero) digits is 5040, while the sum is 31.
The square root of 117504049 is about 10839.9284591735. The cubic root of 117504049 is about 489.7986803132.
The spelling of 117504049 in words is "one hundred seventeen million, five hundred four thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •