Base | Representation |
---|---|
bin | 10110000010110100… |
… | …01000101100110110 |
3 | 1010112210020120000000 |
4 | 23001122020230312 |
5 | 143214201214122 |
6 | 5234204332130 |
7 | 566164021014 |
oct | 130132105466 |
9 | 33483216000 |
10 | 11834788662 |
11 | 502347a984 |
12 | 2363544046 |
13 | 1167b6b038 |
14 | 803ad38b4 |
15 | 493ed90ac |
hex | 2c1688b36 |
11834788662 has 64 divisors (see below), whose sum is σ = 27274000320. Its totient is φ = 3848653440.
The previous prime is 11834788643. The next prime is 11834788673. The reversal of 11834788662 is 26688743811.
11834788662 is a `hidden beast` number, since 11 + 83 + 478 + 86 + 6 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 11834788599 and 11834788608.
It is a congruent number.
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, 146338 + ... + 212330.
It is an arithmetic number, because the mean of its divisors is an integer number (426156255).
Almost surely, 211834788662 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11834788662, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13637000160).
11834788662 is an abundant number, since it is smaller than the sum of its proper divisors (15439211658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11834788662 is an frugal number, since it uses more digits than its factorization.
11834788662 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66057 (or 66039 counting only the distinct ones).
The product of its digits is 3096576, while the sum is 54.
The spelling of 11834788662 in words is "eleven billion, eight hundred thirty-four million, seven hundred eighty-eight thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •