Base | Representation |
---|---|
bin | 110001111111… |
… | …110101000000 |
3 | 220122212201210 |
4 | 301333311000 |
5 | 11323401441 |
6 | 1144530120 |
7 | 216255234 |
oct | 61776500 |
9 | 26585653 |
10 | 13106496 |
11 | 7442117 |
12 | 4480940 |
13 | 293b830 |
14 | 1a525c4 |
15 | 123d616 |
hex | c7fd40 |
13106496 has 112 divisors (see below), whose sum is σ = 38404800. Its totient is φ = 3919872.
The previous prime is 13106491. The next prime is 13106497. The reversal of 13106496 is 69460131.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13106491) 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 15 ways as a sum of consecutive naturals, for example, 147220 + ... + 147308.
It is an arithmetic number, because the mean of its divisors is an integer number (342900).
Almost surely, 213106496 is an apocalyptic number.
13106496 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 13106496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19202400).
13106496 is an abundant number, since it is smaller than the sum of its proper divisors (25298304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13106496 is a wasteful number, since it uses less digits than its factorization.
13106496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176 (or 166 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 30.
The square root of 13106496 is about 3620.2894911871. The cubic root of 13106496 is about 235.7737945513.
The spelling of 13106496 in words is "thirteen million, one hundred six thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •