Base | Representation |
---|---|
bin | 110110100010101001… |
… | …1111001001101010000 |
3 | 102012022210001001110210 |
4 | 1231011103321031100 |
5 | 3404334000204302 |
6 | 125450221124120 |
7 | 11314341506232 |
oct | 1550523711520 |
9 | 365283031423 |
10 | 117126959952 |
11 | 4574512a662 |
12 | 1a8496b9640 |
13 | b077bc5982 |
14 | 595194c252 |
15 | 30a7b3e66c |
hex | 1b454f9350 |
117126959952 has 80 divisors (see below), whose sum is σ = 314176320000. Its totient is φ = 37555779072.
The previous prime is 117126959863. The next prime is 117126959977. The reversal of 117126959952 is 259959621711.
It is a junction number, because it is equal to n+sod(n) for n = 117126959892 and 117126959901.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 218049 + ... + 530847.
It is an arithmetic number, because the mean of its divisors is an integer number (3927204000).
Almost surely, 2117126959952 is an apocalyptic number.
117126959952 is a gapful number since it is divisible by the number (12) 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 117126959952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157088160000).
117126959952 is an abundant number, since it is smaller than the sum of its proper divisors (197049360048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117126959952 is a wasteful number, since it uses less digits than its factorization.
117126959952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 313108 (or 313102 counting only the distinct ones).
The product of its digits is 3061800, while the sum is 57.
The spelling of 117126959952 in words is "one hundred seventeen billion, one hundred twenty-six million, nine hundred fifty-nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •