Base | Representation |
---|---|
bin | 110001110011… |
… | …011011010100 |
3 | 220120022001110 |
4 | 301303123110 |
5 | 11320240300 |
6 | 1143455020 |
7 | 215654160 |
oct | 61633324 |
9 | 26508043 |
10 | 13055700 |
11 | 7407a39 |
12 | 4457470 |
13 | 2921688 |
14 | 1a3bca0 |
15 | 122d550 |
hex | c736d4 |
13055700 has 72 divisors (see below), whose sum is σ = 43177792. Its totient is φ = 2983680.
The previous prime is 13055683. The next prime is 13055701. The reversal of 13055700 is 755031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13055701) 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 23 ways as a sum of consecutive naturals, for example, 1009 + ... + 5208.
Almost surely, 213055700 is an apocalyptic number.
13055700 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 13055700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21588896).
13055700 is an abundant number, since it is smaller than the sum of its proper divisors (30122092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13055700 is a wasteful number, since it uses less digits than its factorization.
13055700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6241 (or 6234 counting only the distinct ones).
The product of its (nonzero) digits is 525, while the sum is 21.
The square root of 13055700 is about 3613.2672195674. The cubic root of 13055700 is about 235.4688091182.
The spelling of 13055700 in words is "thirteen million, fifty-five thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.291 sec. • engine limits •