Base | Representation |
---|---|
bin | 110001111111… |
… | …010110000000 |
3 | 220122210000022 |
4 | 301333112000 |
5 | 11323321022 |
6 | 1144513012 |
7 | 216246401 |
oct | 61772600 |
9 | 26583008 |
10 | 13104512 |
11 | 7440683 |
12 | 447b768 |
13 | 293a965 |
14 | 1a519a8 |
15 | 123cc42 |
hex | c7f580 |
13104512 has 32 divisors (see below), whose sum is σ = 26821920. Its totient is φ = 6372864.
The previous prime is 13104451. The next prime is 13104521. The reversal of 13104512 is 21540131.
13104512 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (32).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3353 + ... + 6119.
It is an arithmetic number, because the mean of its divisors is an integer number (838185).
Almost surely, 213104512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13104512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13410960).
13104512 is an abundant number, since it is smaller than the sum of its proper divisors (13717408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13104512 is an equidigital number, since it uses as much as digits as its factorization.
13104512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2818 (or 2806 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 13104512 is about 3620.0154695802. The cubic root of 13104512 is about 235.7618971733.
Adding to 13104512 its reverse (21540131), we get a palindrome (34644643).
The spelling of 13104512 in words is "thirteen million, one hundred four thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •