Base | Representation |
---|---|
bin | 10101110100010011… |
… | …00011010100000000 |
3 | 1010020022002002022220 |
4 | 22322021203110000 |
5 | 142442012010304 |
6 | 5214134131040 |
7 | 563154602046 |
oct | 127211432400 |
9 | 33208062286 |
10 | 11713000704 |
11 | 4a70757879 |
12 | 232a7b0a80 |
13 | 1148869362 |
14 | 7d1870396 |
15 | 48847dad9 |
hex | 2ba263500 |
11713000704 has 288 divisors, whose sum is σ = 33624944640. Its totient is φ = 3612672000.
The previous prime is 11713000703. The next prime is 11713000709. The reversal of 11713000704 is 40700031711.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11713000703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 92228289 + ... + 92228415.
It is an arithmetic number, because the mean of its divisors is an integer number (116753280).
Almost surely, 211713000704 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11713000704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16812472320).
11713000704 is an abundant number, since it is smaller than the sum of its proper divisors (21911943936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11713000704 is a wasteful number, since it uses less digits than its factorization.
11713000704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317 (or 303 counting only the distinct ones).
The product of its (nonzero) digits is 588, while the sum is 24.
The spelling of 11713000704 in words is "eleven billion, seven hundred thirteen million, seven hundred four", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •