Base | Representation |
---|---|
bin | 110110101011001001… |
… | …1110110011000010101 |
3 | 102020001122200202211020 |
4 | 1231112103312120111 |
5 | 3410430003123140 |
6 | 125534410031353 |
7 | 11324403621264 |
oct | 1552623663025 |
9 | 366048622736 |
10 | 117412161045 |
11 | 45881116443 |
12 | 1a909118559 |
13 | b0c201180a |
14 | 597b78c5db |
15 | 30c2bc86d0 |
hex | 1b564f6615 |
117412161045 has 32 divisors (see below), whose sum is σ = 192469737600. Its totient is φ = 61083509760.
The previous prime is 117412161043. The next prime is 117412161067. The reversal of 117412161045 is 540161214711.
It is not a de Polignac number, because 117412161045 - 21 = 117412161043 is a prime.
It is a super-2 number, since 2×1174121610452 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 117412160997 and 117412161015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117412161043) 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, 7043881 + ... + 7060529.
It is an arithmetic number, because the mean of its divisors is an integer number (6014679300).
Almost surely, 2117412161045 is an apocalyptic number.
117412161045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
117412161045 is a deficient number, since it is larger than the sum of its proper divisors (75057576555).
117412161045 is a wasteful number, since it uses less digits than its factorization.
117412161045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28165.
The product of its (nonzero) digits is 6720, while the sum is 33.
Adding to 117412161045 its reverse (540161214711), we get a palindrome (657573375756).
The spelling of 117412161045 in words is "one hundred seventeen billion, four hundred twelve million, one hundred sixty-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •