Base | Representation |
---|---|
bin | 10101111010110111… |
… | …00000011001010000 |
3 | 1010101010122022200000 |
4 | 22331123200121100 |
5 | 143100104221432 |
6 | 5223421530000 |
7 | 564423452403 |
oct | 127533403120 |
9 | 33333568600 |
10 | 11768038992 |
11 | 4a99829966 |
12 | 2345113900 |
13 | 1157099aa8 |
14 | 7d8cb9d3a |
15 | 48d20157c |
hex | 2bd6e0650 |
11768038992 has 360 divisors, whose sum is σ = 36561514080. Its totient is φ = 3662184960.
The previous prime is 11768038969. The next prime is 11768038993. The reversal of 11768038992 is 29983086711.
11768038992 is a `hidden beast` number, since 1 + 176 + 8 + 0 + 389 + 92 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11768038993) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 192918642 + ... + 192918702.
Almost surely, 211768038992 is an apocalyptic number.
11768038992 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 11768038992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18280757040).
11768038992 is an abundant number, since it is smaller than the sum of its proper divisors (24793475088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11768038992 is an equidigital number, since it uses as much as digits as its factorization.
11768038992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201 (or 154 counting only the distinct ones).
The product of its (nonzero) digits is 1306368, while the sum is 54.
The spelling of 11768038992 in words is "eleven billion, seven hundred sixty-eight million, thirty-eight thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •