Base | Representation |
---|---|
bin | 110110111001010100… |
… | …1100010100011100100 |
3 | 102021021210100000212222 |
4 | 1231302221202203210 |
5 | 3412413211442220 |
6 | 130053512331512 |
7 | 11342236100144 |
oct | 1556251424344 |
9 | 367253300788 |
10 | 117887609060 |
11 | 45aa5533591 |
12 | 1aa203a3b98 |
13 | b16967b5c0 |
14 | 59c4992924 |
15 | 30ee7e1e25 |
hex | 1b72a628e4 |
117887609060 has 96 divisors (see below), whose sum is σ = 282118298112. Its totient is φ = 41048663040.
The previous prime is 117887609027. The next prime is 117887609107. The reversal of 117887609060 is 60906788711.
It is a junction number, because it is equal to n+sod(n) for n = 117887608993 and 117887609011.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 285752 + ... + 563408.
It is an arithmetic number, because the mean of its divisors is an integer number (2938732272).
Almost surely, 2117887609060 is an apocalyptic number.
117887609060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 117887609060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (141059149056).
117887609060 is an abundant number, since it is smaller than the sum of its proper divisors (164230689052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117887609060 is a wasteful number, since it uses less digits than its factorization.
117887609060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277773 (or 277771 counting only the distinct ones).
The product of its (nonzero) digits is 1016064, while the sum is 53.
The spelling of 117887609060 in words is "one hundred seventeen billion, eight hundred eighty-seven million, six hundred nine thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •