Base | Representation |
---|---|
bin | 110100000100… |
… | …101001001000 |
3 | 221200111222020 |
4 | 310010221020 |
5 | 11443304004 |
6 | 1204324440 |
7 | 224012250 |
oct | 64045110 |
9 | 27614866 |
10 | 13650504 |
11 | 778390a |
12 | 46a3720 |
13 | 2a9c32a |
14 | 1b54960 |
15 | 12e98d9 |
hex | d04a48 |
13650504 has 64 divisors (see below), whose sum is σ = 39296640. Its totient is φ = 3870720.
The previous prime is 13650491. The next prime is 13650517. The reversal of 13650504 is 40505631.
It is an interprime number because it is at equal distance from previous prime (13650491) and next prime (13650517).
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 15 ways as a sum of consecutive naturals, for example, 32214 + ... + 32634.
It is an arithmetic number, because the mean of its divisors is an integer number (614010).
Almost surely, 213650504 is an apocalyptic number.
13650504 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 13650504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19648320).
13650504 is an abundant number, since it is smaller than the sum of its proper divisors (25646136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13650504 is a wasteful number, since it uses less digits than its factorization.
13650504 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 630 (or 626 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 13650504 is about 3694.6588475798. The cubic root of 13650504 is about 238.9917423896.
The spelling of 13650504 in words is "thirteen million, six hundred fifty thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •