Base | Representation |
---|---|
bin | 110001110100… |
… | …000111000000 |
3 | 220120102220000 |
4 | 301310013000 |
5 | 11320332441 |
6 | 1143520000 |
7 | 215665263 |
oct | 61640700 |
9 | 26512800 |
10 | 13058496 |
11 | 740a050 |
12 | 4459000 |
13 | 2922a29 |
14 | 1a3ccda |
15 | 122e2b6 |
hex | c741c0 |
13058496 has 140 divisors (see below), whose sum is σ = 42412920. Its totient is φ = 3939840.
The previous prime is 13058489. The next prime is 13058537. The reversal of 13058496 is 69485031.
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 13058496.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 56910 + ... + 57138.
Almost surely, 213058496 is an apocalyptic number.
13058496 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 13058496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21206460).
13058496 is an abundant number, since it is smaller than the sum of its proper divisors (29354424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13058496 is a wasteful number, since it uses less digits than its factorization.
13058496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264 (or 245 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 13058496 is about 3613.6541063029. The cubic root of 13058496 is about 235.4856171994.
It can be divided in two parts, 1305 and 8496, that added together give a square (9801 = 992).
The spelling of 13058496 in words is "thirteen million, fifty-eight thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •