Base | Representation |
---|---|
bin | 110100011111… |
… | …011111110000 |
3 | 221220002212000 |
4 | 310133133300 |
5 | 12010313441 |
6 | 1210534000 |
7 | 224651031 |
oct | 64373760 |
9 | 27802760 |
10 | 13760496 |
11 | 7849512 |
12 | 4737300 |
13 | 2b0a409 |
14 | 1b82a88 |
15 | 131c2b6 |
hex | d1f7f0 |
13760496 has 80 divisors (see below), whose sum is σ = 40309920. Its totient is φ = 4492800.
The previous prime is 13760477. The next prime is 13760501. The reversal of 13760496 is 69406731.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 13760496.
It is a congruent number.
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, 22596 + ... + 23196.
It is an arithmetic number, because the mean of its divisors is an integer number (503874).
Almost surely, 213760496 is an apocalyptic number.
13760496 is a gapful number since it is divisible by the number (16) 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 13760496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20154960).
13760496 is an abundant number, since it is smaller than the sum of its proper divisors (26549424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13760496 is a wasteful number, since it uses less digits than its factorization.
13760496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671 (or 659 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 36.
The square root of 13760496 is about 3709.5142539152. The cubic root of 13760496 is about 239.6319358251.
The spelling of 13760496 in words is "thirteen million, seven hundred sixty thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •