Base | Representation |
---|---|
bin | 110001111111… |
… | …010101111000 |
3 | 220122210000000 |
4 | 301333111320 |
5 | 11323321004 |
6 | 1144513000 |
7 | 216246360 |
oct | 61772570 |
9 | 26583000 |
10 | 13104504 |
11 | 7440676 |
12 | 447b760 |
13 | 293a95a |
14 | 1a519a0 |
15 | 123cc39 |
hex | c7f578 |
13104504 has 128 divisors (see below), whose sum is σ = 42508800. Its totient is φ = 3709152.
The previous prime is 13104451. The next prime is 13104521. The reversal of 13104504 is 40540131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 122419 + ... + 122525.
It is an arithmetic number, because the mean of its divisors is an integer number (332100).
Almost surely, 213104504 is an apocalyptic number.
13104504 is a gapful number since it is divisible by the number (14) 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 13104504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21254400).
13104504 is an abundant number, since it is smaller than the sum of its proper divisors (29404296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13104504 is an equidigital number, since it uses as much as digits as its factorization.
13104504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141 (or 119 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 13104504 is about 3620.0143646124. The cubic root of 13104504 is about 235.7618491975.
Adding to 13104504 its reverse (40540131), we get a palindrome (53644635).
The spelling of 13104504 in words is "thirteen million, one hundred four thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •