Base | Representation |
---|---|
bin | 110110110001101100… |
… | …0100100100110001111 |
3 | 102020121221102111001112 |
4 | 1231203120210212033 |
5 | 3411402131041420 |
6 | 130012243202235 |
7 | 11333006163365 |
oct | 1554330444617 |
9 | 366557374045 |
10 | 117631502735 |
11 | 45983a0a06a |
12 | 1a96a67637b |
13 | b1285ab6b6 |
14 | 599c967635 |
15 | 30d70a38c5 |
hex | 1b6362498f |
117631502735 has 32 divisors (see below), whose sum is σ = 147291955200. Its totient is φ = 90073226880.
The previous prime is 117631502731. The next prime is 117631502753. The reversal of 117631502735 is 537205136711.
It is not a de Polignac number, because 117631502735 - 22 = 117631502731 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 117631502692 and 117631502701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117631502731) 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 31 ways as a sum of consecutive naturals, for example, 43071320 + ... + 43074050.
It is an arithmetic number, because the mean of its divisors is an integer number (4602873600).
Almost surely, 2117631502735 is an apocalyptic number.
117631502735 is a deficient number, since it is larger than the sum of its proper divisors (29660452465).
117631502735 is a wasteful number, since it uses less digits than its factorization.
117631502735 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5231.
The product of its (nonzero) digits is 132300, while the sum is 41.
The spelling of 117631502735 in words is "one hundred seventeen billion, six hundred thirty-one million, five hundred two thousand, seven hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •