Base | Representation |
---|---|
bin | 110010010110… |
… | …110011011000 |
3 | 220211122211010 |
4 | 302112303120 |
5 | 11334404400 |
6 | 1150533520 |
7 | 220126500 |
oct | 62266330 |
9 | 26748733 |
10 | 13200600 |
11 | 74a6896 |
12 | 45072a0 |
13 | 297260a |
14 | 1a78a00 |
15 | 125b450 |
hex | c96cd8 |
13200600 has 144 divisors (see below), whose sum is σ = 47709000. Its totient is φ = 3010560.
The previous prime is 13200587. The next prime is 13200617. The reversal of 13200600 is 600231.
13200600 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 29176 + ... + 29624.
Almost surely, 213200600 is an apocalyptic number.
13200600 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 13200600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23854500).
13200600 is an abundant number, since it is smaller than the sum of its proper divisors (34508400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13200600 is a wasteful number, since it uses less digits than its factorization.
13200600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 482 (or 466 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 13200600 is about 3633.2629962611. The cubic root of 13200600 is about 236.3367308446.
Adding to 13200600 its reverse (600231), we get a palindrome (13800831).
The spelling of 13200600 in words is "thirteen million, two hundred thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •