Base | Representation |
---|---|
bin | 110110100100001001… |
… | …1001101001101001100 |
3 | 102012110021102000021210 |
4 | 1231020103031031030 |
5 | 3404434320030442 |
6 | 125455212054420 |
7 | 11315521004256 |
oct | 1551023151514 |
9 | 365407360253 |
10 | 117177111372 |
11 | 45770474112 |
12 | 1a862464410 |
13 | b085404c79 |
14 | 5958484cd6 |
15 | 30ac24919c |
hex | 1b484cd34c |
117177111372 has 96 divisors (see below), whose sum is σ = 300428826880. Its totient is φ = 35412837120.
The previous prime is 117177111367. The next prime is 117177111383. The reversal of 117177111372 is 273111771711.
It is a self number, because there is not a number n which added to its sum of digits gives 117177111372.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 400743 + ... + 628449.
Almost surely, 2117177111372 is an apocalyptic number.
117177111372 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 117177111372, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150214413440).
117177111372 is an abundant number, since it is smaller than the sum of its proper divisors (183251715508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117177111372 is a wasteful number, since it uses less digits than its factorization.
117177111372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227831 (or 227829 counting only the distinct ones).
The product of its digits is 14406, while the sum is 39.
The spelling of 117177111372 in words is "one hundred seventeen billion, one hundred seventy-seven million, one hundred eleven thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •