Base | Representation |
---|---|
bin | 11000110100110010… |
… | …00010111101000000 |
3 | 1021101211101001100000 |
4 | 30122121002331000 |
5 | 204243341101300 |
6 | 10042254200000 |
7 | 651162240630 |
oct | 143231027500 |
9 | 37354331300 |
10 | 13327675200 |
11 | 571a141704 |
12 | 26bb4b3000 |
13 | 134523c558 |
14 | 9060a46c0 |
15 | 5300cac00 |
hex | 31a642f40 |
13327675200 has 1008 divisors, whose sum is σ = 57781301760. Its totient is φ = 2958612480.
The previous prime is 13327675199. The next prime is 13327675213. The reversal of 13327675200 is 257672331.
It is a tau number, because it is divible by the number of its divisors (1008).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 160574359 + ... + 160574441.
It is an arithmetic number, because the mean of its divisors is an integer number (57322720).
Almost surely, 213327675200 is an apocalyptic number.
13327675200 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 13327675200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28890650880).
13327675200 is an abundant number, since it is smaller than the sum of its proper divisors (44453626560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13327675200 is an equidigital number, since it uses as much as digits as its factorization.
13327675200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186 (or 159 counting only the distinct ones).
The product of its (nonzero) digits is 52920, while the sum is 36.
The spelling of 13327675200 in words is "thirteen billion, three hundred twenty-seven million, six hundred seventy-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •