Base | Representation |
---|---|
bin | 110110100000011110… |
… | …0001000001100110111 |
3 | 102012010200001001102001 |
4 | 1231000330020030313 |
5 | 3404211211333142 |
6 | 125435041200131 |
7 | 11312461235206 |
oct | 1550074101467 |
9 | 365120031361 |
10 | 117053621047 |
11 | 45707798aa0 |
12 | 1a829030047 |
13 | b06595847c |
14 | 5945cdb23d |
15 | 30a14a45b7 |
hex | 1b40f08337 |
117053621047 has 8 divisors (see below), whose sum is σ = 130809368592. Its totient is φ = 103816958400.
The previous prime is 117053621039. The next prime is 117053621063. The reversal of 117053621047 is 740126350711.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 117053621047 - 23 = 117053621039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 117053620997 and 117053621015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117053621077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 129770748 + ... + 129771649.
It is an arithmetic number, because the mean of its divisors is an integer number (16351171074).
Almost surely, 2117053621047 is an apocalyptic number.
117053621047 is a deficient number, since it is larger than the sum of its proper divisors (13755747545).
117053621047 is a wasteful number, since it uses less digits than its factorization.
117053621047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259542449.
The product of its (nonzero) digits is 35280, while the sum is 37.
Adding to 117053621047 its reverse (740126350711), we get a palindrome (857179971758).
The spelling of 117053621047 in words is "one hundred seventeen billion, fifty-three million, six hundred twenty-one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •