Base | Representation |
---|---|
bin | 110110011111001011… |
… | …1110000010100110101 |
3 | 102012000122221212211222 |
4 | 1230332113300110311 |
5 | 3404114144003022 |
6 | 125430501440125 |
7 | 11311426052126 |
oct | 1547627602465 |
9 | 365018855758 |
10 | 117010531637 |
11 | 4569543830a |
12 | 1a816710045 |
13 | b059a4c68c |
14 | 59402c204d |
15 | 309c7e2242 |
hex | 1b3e5f0535 |
117010531637 has 32 divisors (see below), whose sum is σ = 126969223680. Its totient is φ = 107539660800.
The previous prime is 117010531609. The next prime is 117010531639. The reversal of 117010531637 is 736135010711.
It is a cyclic number.
It is not a de Polignac number, because 117010531637 - 28 = 117010531381 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 117010531597 and 117010531606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117010531639) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35147189 + ... + 35150517.
It is an arithmetic number, because the mean of its divisors is an integer number (3967788240).
Almost surely, 2117010531637 is an apocalyptic number.
It is an amenable number.
117010531637 is a deficient number, since it is larger than the sum of its proper divisors (9958692043).
117010531637 is a wasteful number, since it uses less digits than its factorization.
117010531637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3893.
The product of its (nonzero) digits is 13230, while the sum is 35.
The spelling of 117010531637 in words is "one hundred seventeen billion, ten million, five hundred thirty-one thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •