Base | Representation |
---|---|
bin | 110010110001… |
… | …011101101000 |
3 | 221001012121120 |
4 | 302301131220 |
5 | 11401403200 |
6 | 1153135240 |
7 | 221063040 |
oct | 62613550 |
9 | 27035546 |
10 | 13309800 |
11 | 7570939 |
12 | 455a520 |
13 | 29b022a |
14 | 1aa6720 |
15 | 127d9a0 |
hex | cb1768 |
13309800 has 96 divisors (see below), whose sum is σ = 47169600. Its totient is φ = 3041280.
The previous prime is 13309771. The next prime is 13309817. The reversal of 13309800 is 890331.
13309800 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 (24).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2616 + ... + 5784.
It is an arithmetic number, because the mean of its divisors is an integer number (491350).
Almost surely, 213309800 is an apocalyptic number.
13309800 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 13309800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23584800).
13309800 is an abundant number, since it is smaller than the sum of its proper divisors (33859800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13309800 is a wasteful number, since it uses less digits than its factorization.
13309800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3195 (or 3186 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
The square root of 13309800 is about 3648.2598591657. The cubic root of 13309800 is about 236.9866288812.
The spelling of 13309800 in words is "thirteen million, three hundred nine thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •