Base | Representation |
---|---|
bin | 1101111110101… |
… | …11111100110010 |
3 | 22011200021001211 |
4 | 12333113330302 |
5 | 220010321331 |
6 | 15345350334 |
7 | 2622555616 |
oct | 677277462 |
9 | 264607054 |
10 | 117276466 |
11 | 602215aa |
12 | 333383aa |
13 | 1b3b2378 |
14 | 1180b346 |
15 | a4688b1 |
hex | 6fd7f32 |
117276466 has 4 divisors (see below), whose sum is σ = 175914702. Its totient is φ = 58638232.
The previous prime is 117276463. The next prime is 117276469. The reversal of 117276466 is 664672711.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 664672711 = 3607 ⋅184273.
It is an interprime number because it is at equal distance from previous prime (117276463) and next prime (117276469).
It can be written as a sum of positive squares in only one way, i.e., 65853225 + 51423241 = 8115^2 + 7171^2 .
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (117276461) 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 as a sum of consecutive naturals, namely, 29319115 + ... + 29319118.
Almost surely, 2117276466 is an apocalyptic number.
117276466 is a deficient number, since it is larger than the sum of its proper divisors (58638236).
117276466 is an equidigital number, since it uses as much as digits as its factorization.
117276466 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58638235.
The product of its digits is 84672, while the sum is 40.
The square root of 117276466 is about 10829.4259312301. The cubic root of 117276466 is about 489.4822603066.
The spelling of 117276466 in words is "one hundred seventeen million, two hundred seventy-six thousand, four hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •