Base | Representation |
---|---|
bin | 110110101101101111… |
… | …0011001111000001001 |
3 | 102020021200202012021111 |
4 | 1231123132121320021 |
5 | 3411114144021321 |
6 | 125551143210321 |
7 | 11326505303554 |
oct | 1553336317011 |
9 | 366250665244 |
10 | 117498813961 |
11 | 45916021021 |
12 | 1a9321469a1 |
13 | b106c61129 |
14 | 59890a769b |
15 | 30ca5e35e1 |
hex | 1b5b799e09 |
117498813961 has 9 divisors (see below), whose sum is σ = 119032400781. Its totient is φ = 115984750284.
The previous prime is 117498813959. The next prime is 117498813967. The reversal of 117498813961 is 169318894711.
It is a happy number.
The square root of 117498813961 is 342781.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 117498813961 - 21 = 117498813959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 117498813896 and 117498813905.
It is not an unprimeable number, because it can be changed into a prime (117498813967) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 27077530 + ... + 27081868.
It is an arithmetic number, because the mean of its divisors is an integer number (13225822309).
Almost surely, 2117498813961 is an apocalyptic number.
117498813961 is the 342781-st square number.
117498813961 is the 171391-st centered octagonal number.
It is an amenable number.
117498813961 is a deficient number, since it is larger than the sum of its proper divisors (1533586820).
117498813961 is an frugal number, since it uses more digits than its factorization.
117498813961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8836 (or 4418 counting only the distinct ones).
The product of its digits is 2612736, while the sum is 58.
The spelling of 117498813961 in words is "one hundred seventeen billion, four hundred ninety-eight million, eight hundred thirteen thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •