Base | Representation |
---|---|
bin | 1110000000110… |
… | …10011110010011 |
3 | 22012012002211201 |
4 | 13000122132103 |
5 | 220043031242 |
6 | 15355252031 |
7 | 2625102205 |
oct | 700323623 |
9 | 265162751 |
10 | 117548947 |
11 | 6039829a |
12 | 3344a017 |
13 | 1b4793b9 |
14 | 1187c775 |
15 | a4be4b7 |
hex | 701a793 |
117548947 has 2 divisors, whose sum is σ = 117548948. Its totient is φ = 117548946.
The previous prime is 117548941. The next prime is 117548987. The reversal of 117548947 is 749845711.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (749845711) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-117548947 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 117548897 and 117548906.
It is not a weakly prime, because it can be changed into another prime (117548941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58774473 + 58774474.
It is an arithmetic number, because the mean of its divisors is an integer number (58774474).
Almost surely, 2117548947 is an apocalyptic number.
117548947 is a deficient number, since it is larger than the sum of its proper divisors (1).
117548947 is an equidigital number, since it uses as much as digits as its factorization.
117548947 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 282240, while the sum is 46.
The square root of 117548947 is about 10841.9992160118. Note that the first 3 decimals coincide. The cubic root of 117548947 is about 489.8610559818.
The spelling of 117548947 in words is "one hundred seventeen million, five hundred forty-eight thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •