Base | Representation |
---|---|
bin | 1110000011111… |
… | …11111111111111 |
3 | 22012222020021122 |
4 | 13001333333333 |
5 | 220144333144 |
6 | 15412221155 |
7 | 2631453461 |
oct | 701777777 |
9 | 265866248 |
10 | 117964799 |
11 | 60651777 |
12 | 3360a7bb |
13 | 1b593774 |
14 | 1194a131 |
15 | a5527ee |
hex | 707ffff |
117964799 has 4 divisors (see below), whose sum is σ = 118424064. Its totient is φ = 117505536.
The previous prime is 117964793. The next prime is 117964801. The reversal of 117964799 is 997469711.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 997469711 = 7 ⋅142495673.
It is a cyclic number.
It is not a de Polignac number, because 117964799 - 28 = 117964543 is a prime.
It is a super-2 number, since 2×1179647992 = 27831387606220802, which contains 22 as substring.
It is a Duffinian number.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 117964799.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117964793) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 229247 + ... + 229760.
It is an arithmetic number, because the mean of its divisors is an integer number (29606016).
Almost surely, 2117964799 is an apocalyptic number.
117964799 is a deficient number, since it is larger than the sum of its proper divisors (459265).
117964799 is an equidigital number, since it uses as much as digits as its factorization.
117964799 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 459264.
The product of its digits is 857304, while the sum is 53.
The square root of 117964799 is about 10861.1601129898. The cubic root of 117964799 is about 490.4380353460.
The spelling of 117964799 in words is "one hundred seventeen million, nine hundred sixty-four thousand, seven hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •