Base | Representation |
---|---|
bin | 11000100101100110… |
… | …01110011000000000 |
3 | 1021001221201201211202 |
4 | 30102303032120000 |
5 | 204013240220000 |
6 | 10021504400332 |
7 | 645054603650 |
oct | 142263163000 |
9 | 37057651752 |
10 | 13200320000 |
11 | 566426687a |
12 | 26849160a8 |
13 | 1324a3b84a |
14 | 8d31d2360 |
15 | 523d20dd5 |
hex | 312cce600 |
13200320000 has 400 divisors, whose sum is σ = 38657025792. Its totient is φ = 4408320000.
The previous prime is 13200319997. The next prime is 13200320069. The reversal of 13200320000 is 2300231.
It is a tau number, because it is divible by the number of its divisors (400).
It is a congruent number.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 159039959 + ... + 159040041.
Almost surely, 213200320000 is an apocalyptic number.
13200320000 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 13200320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19328512896).
13200320000 is an abundant number, since it is smaller than the sum of its proper divisors (25456705792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13200320000 is an frugal number, since it uses more digits than its factorization.
13200320000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199 (or 168 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 11.
Adding to 13200320000 its reverse (2300231), we get a palindrome (13202620231).
The spelling of 13200320000 in words is "thirteen billion, two hundred million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •