Base | Representation |
---|---|
bin | 110110100001001001… |
… | …0000011100110000000 |
3 | 102012012020102110121022 |
4 | 1231002102003212000 |
5 | 3404232443142220 |
6 | 125441204045012 |
7 | 11313153553232 |
oct | 1550222034600 |
9 | 365166373538 |
10 | 117076146560 |
11 | 4571948381a |
12 | 1a834693768 |
13 | b06a514289 |
14 | 5948cc2252 |
15 | 30a3453925 |
hex | 1b42483980 |
117076146560 has 32 divisors (see below), whose sum is σ = 279885164400. Its totient is φ = 46830458368.
The previous prime is 117076146547. The next prime is 117076146563. The reversal of 117076146560 is 65641670711.
117076146560 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117076146563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91465100 + ... + 91466379.
Almost surely, 2117076146560 is an apocalyptic number.
117076146560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
117076146560 is an abundant number, since it is smaller than the sum of its proper divisors (162809017840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117076146560 is an equidigital number, since it uses as much as digits as its factorization.
117076146560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182931498 (or 182931486 counting only the distinct ones).
The product of its (nonzero) digits is 211680, while the sum is 44.
The spelling of 117076146560 in words is "one hundred seventeen billion, seventy-six million, one hundred forty-six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •