Base | Representation |
---|---|
bin | 110110110011000011… |
… | …1011101001110000001 |
3 | 102020202010200122112200 |
4 | 1231212013131032001 |
5 | 3412000400111323 |
6 | 130021001543413 |
7 | 11334103644252 |
oct | 1554607351601 |
9 | 366663618480 |
10 | 117677347713 |
11 | 459a7882082 |
12 | 1a981aa4b69 |
13 | b134c407c3 |
14 | 59a4a9cb29 |
15 | 30db10c443 |
hex | 1b661dd381 |
117677347713 has 6 divisors (see below), whose sum is σ = 169978391154. Its totient is φ = 78451565136.
The previous prime is 117677347687. The next prime is 117677347741. The reversal of 117677347713 is 317743776711.
It can be written as a sum of positive squares in only one way, i.e., 109159534449 + 8517813264 = 330393^2 + 92292^2 .
It is not a de Polignac number, because 117677347713 - 25 = 117677347681 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 117677347713.
It is not an unprimeable number, because it can be changed into a prime (117677347013) 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 5 ways as a sum of consecutive naturals, for example, 6537630420 + ... + 6537630437.
It is an arithmetic number, because the mean of its divisors is an integer number (28329731859).
Almost surely, 2117677347713 is an apocalyptic number.
It is an amenable number.
117677347713 is a deficient number, since it is larger than the sum of its proper divisors (52301043441).
117677347713 is a wasteful number, since it uses less digits than its factorization.
117677347713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13075260863 (or 13075260860 counting only the distinct ones).
The product of its digits is 3630312, while the sum is 54.
The spelling of 117677347713 in words is "one hundred seventeen billion, six hundred seventy-seven million, three hundred forty-seven thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •