Base | Representation |
---|---|
bin | 110110101111100110… |
… | …1101001011100001111 |
3 | 102020110001202111200110 |
4 | 1231133031221130033 |
5 | 3411231222431002 |
6 | 130001303331103 |
7 | 11331166342536 |
oct | 1553715513417 |
9 | 366401674613 |
10 | 117561530127 |
11 | 45948467668 |
12 | 1a94b150a93 |
13 | b116c4c4a2 |
14 | 599355131d |
15 | 30d0d80e6c |
hex | 1b5f36970f |
117561530127 has 8 divisors (see below), whose sum is σ = 156750652800. Its totient is φ = 78373380440.
The previous prime is 117561530077. The next prime is 117561530147. The reversal of 117561530127 is 721035165711.
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 117561530127 - 211 = 117561528079 is a prime.
It is a super-2 number, since 2×1175615301272 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117561530147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113374 + ... + 497972.
It is an arithmetic number, because the mean of its divisors is an integer number (19593831600).
Almost surely, 2117561530127 is an apocalyptic number.
117561530127 is a deficient number, since it is larger than the sum of its proper divisors (39189122673).
117561530127 is a wasteful number, since it uses less digits than its factorization.
117561530127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486493.
The product of its (nonzero) digits is 44100, while the sum is 39.
Adding to 117561530127 its reverse (721035165711), we get a palindrome (838596695838).
The spelling of 117561530127 in words is "one hundred seventeen billion, five hundred sixty-one million, five hundred thirty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •