Base | Representation |
---|---|
bin | 110110101010111011… |
… | …1100001000101001000 |
3 | 102020001010201102111220 |
4 | 1231111313201011020 |
5 | 3410421102440033 |
6 | 125533542522040 |
7 | 11324253525360 |
oct | 1552567410510 |
9 | 366033642456 |
10 | 117404733768 |
11 | 45877a031a3 |
12 | 1a906736320 |
13 | b0c0610c8a |
14 | 597a7b79a0 |
15 | 30c220cbb3 |
hex | 1b55de1148 |
117404733768 has 128 divisors (see below), whose sum is σ = 345613651200. Its totient is φ = 32541290496.
The previous prime is 117404733749. The next prime is 117404733779. The reversal of 117404733768 is 867337404711.
It is a super-2 number, since 2×1174047337682 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 117404733768.
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, 718380 + ... + 866532.
It is an arithmetic number, because the mean of its divisors is an integer number (2700106650).
Almost surely, 2117404733768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 117404733768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172806825600).
117404733768 is an abundant number, since it is smaller than the sum of its proper divisors (228208917432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117404733768 is a wasteful number, since it uses less digits than its factorization.
117404733768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 148311 (or 148307 counting only the distinct ones).
The product of its (nonzero) digits is 2370816, while the sum is 51.
The spelling of 117404733768 in words is "one hundred seventeen billion, four hundred four million, seven hundred thirty-three thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •