Base | Representation |
---|---|
bin | 110110010100111110… |
… | …0010000011110111000 |
3 | 102011010210000020121212 |
4 | 1230221330100132320 |
5 | 3402413422412000 |
6 | 125332455222252 |
7 | 11300064521243 |
oct | 1545174203670 |
9 | 364123006555 |
10 | 116667779000 |
11 | 45529a13173 |
12 | 1a73b977988 |
13 | b003a33176 |
14 | 590a98025a |
15 | 307c68ac35 |
hex | 1b29f107b8 |
116667779000 has 32 divisors (see below), whose sum is σ = 273002605200. Its totient is φ = 46667111200.
The previous prime is 116667778987. The next prime is 116667779057. The reversal of 116667779000 is 977766611.
It is a happy number.
It is a super-2 number, since 2×1166677790002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a self number, because there is not a number n which added to its sum of digits gives 116667779000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58332890 + ... + 58334889.
Almost surely, 2116667779000 is an apocalyptic number.
116667779000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116667779000 is an abundant number, since it is smaller than the sum of its proper divisors (156334826200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116667779000 is a wasteful number, since it uses less digits than its factorization.
116667779000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116667800 (or 116667786 counting only the distinct ones).
The product of its (nonzero) digits is 666792, while the sum is 50.
The spelling of 116667779000 in words is "one hundred sixteen billion, six hundred sixty-seven million, seven hundred seventy-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •