Base | Representation |
---|---|
bin | 110110100110000001… |
… | …0011001100100001001 |
3 | 102012121122101122200111 |
4 | 1231030002121210021 |
5 | 3410101343030114 |
6 | 125505332034321 |
7 | 11320211660044 |
oct | 1551402314411 |
9 | 365548348614 |
10 | 117239814409 |
11 | 457a2900903 |
12 | 1a87b4629a1 |
13 | b0953ba363 |
14 | 5962927c5b |
15 | 30b29d2bc4 |
hex | 1b4c099909 |
117239814409 has 9 divisors (see below), whose sum is σ = 121432256647. Its totient is φ = 113187474904.
The previous prime is 117239814401. The next prime is 117239814413. The reversal of 117239814409 is 904418932711.
The square root of 117239814409 is 342403.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 61477714809 + 55762099600 = 247947^2 + 236140^2 .
It is not a de Polignac number, because 117239814409 - 23 = 117239814401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (117239814401) 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, 9923784 + ... + 9935590.
Almost surely, 2117239814409 is an apocalyptic number.
117239814409 is the 342403-rd square number.
117239814409 is the 171202-nd centered octagonal number.
It is an amenable number.
117239814409 is a deficient number, since it is larger than the sum of its proper divisors (4192442238).
117239814409 is an frugal number, since it uses more digits than its factorization.
117239814409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23672 (or 11836 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 49.
Multiplying 117239814409 by its sum of digits (49), we get a square (5744750906041 = 23968212).
The spelling of 117239814409 in words is "one hundred seventeen billion, two hundred thirty-nine million, eight hundred fourteen thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •