Base | Representation |
---|---|
bin | 110110101010000110… |
… | …0100100111110011001 |
3 | 102012222011222011211210 |
4 | 1231110030210332121 |
5 | 3410341413402223 |
6 | 125531102013333 |
7 | 11323463330235 |
oct | 1552414447631 |
9 | 365864864753 |
10 | 117376700313 |
11 | 458630a6254 |
12 | 1a8b9277249 |
13 | b0b7877132 |
14 | 5976b9b5c5 |
15 | 30bea21893 |
hex | 1b54324f99 |
117376700313 has 8 divisors (see below), whose sum is σ = 156570528448. Its totient is φ = 78217002864.
The previous prime is 117376700179. The next prime is 117376700369. The reversal of 117376700313 is 313007673711.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 117376700313 - 214 = 117376683929 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (117376700713) 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 in 7 ways as a sum of consecutive naturals, for example, 8524645 + ... + 8538402.
It is an arithmetic number, because the mean of its divisors is an integer number (19571316056).
Almost surely, 2117376700313 is an apocalyptic number.
It is an amenable number.
117376700313 is a deficient number, since it is larger than the sum of its proper divisors (39193828135).
117376700313 is a wasteful number, since it uses less digits than its factorization.
117376700313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17065343.
The product of its (nonzero) digits is 55566, while the sum is 39.
The spelling of 117376700313 in words is "one hundred seventeen billion, three hundred seventy-six million, seven hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •