Base | Representation |
---|---|
bin | 10101110010110101… |
… | …10100101100000000 |
3 | 1010012110000202001000 |
4 | 22321122310230000 |
5 | 142430343013404 |
6 | 5213015412000 |
7 | 562645512660 |
oct | 127132645400 |
9 | 33173022030 |
10 | 11700751104 |
11 | 4a64850539 |
12 | 2326684000 |
13 | 114616a883 |
14 | 7cdda21a0 |
15 | 48735e339 |
hex | 2b96b4b00 |
11700751104 has 576 divisors, whose sum is σ = 42384384000. Its totient is φ = 3112058880.
The previous prime is 11700751099. The next prime is 11700751151. The reversal of 11700751104 is 40115700711.
It is a tau number, because it is divible by the number of its divisors (576).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 43497082 + ... + 43497350.
It is an arithmetic number, because the mean of its divisors is an integer number (73584000).
Almost surely, 211700751104 is an apocalyptic number.
11700751104 is a gapful number since it is divisible by the number (14) 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 11700751104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21192192000).
11700751104 is an abundant number, since it is smaller than the sum of its proper divisors (30683632896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11700751104 is a wasteful number, since it uses less digits than its factorization.
11700751104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361 (or 341 counting only the distinct ones).
The product of its (nonzero) digits is 980, while the sum is 27.
The spelling of 11700751104 in words is "eleven billion, seven hundred million, seven hundred fifty-one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •