Base | Representation |
---|---|
bin | 10100011001000100… |
… | …11000111110000000 |
3 | 1001020222010211102121 |
4 | 22030202120332000 |
5 | 134410111310000 |
6 | 5010200254024 |
7 | 535203265432 |
oct | 121442307600 |
9 | 31228124377 |
10 | 10947760000 |
11 | 47087a8141 |
12 | 2156471314 |
13 | 10561667c8 |
14 | 75bd92652 |
15 | 4411c0b1a |
hex | 28c898f80 |
10947760000 has 160 divisors (see below), whose sum is σ = 27406914480. Its totient is φ = 4354560000.
The previous prime is 10947759973. The next prime is 10947760003. The reversal of 10947760000 is 6774901.
It is a tau number, because it is divible by the number of its divisors (160).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10947760003) 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 19 ways as a sum of consecutive naturals, for example, 22479757 + ... + 22480243.
Almost surely, 210947760000 is an apocalyptic number.
10947760000 is a gapful number since it is divisible by the number (10) 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 10947760000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13703457240).
10947760000 is an abundant number, since it is smaller than the sum of its proper divisors (16459154480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10947760000 is an frugal number, since it uses more digits than its factorization.
10947760000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 802 (or 775 counting only the distinct ones).
The product of its (nonzero) digits is 10584, while the sum is 34.
The spelling of 10947760000 in words is "ten billion, nine hundred forty-seven million, seven hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •