Base | Representation |
---|---|
bin | 110010011000… |
… | …110100000000 |
3 | 220212002010000 |
4 | 302120310000 |
5 | 11340140312 |
6 | 1151040000 |
7 | 220162500 |
oct | 62306400 |
9 | 26762100 |
10 | 13208832 |
11 | 7501a9a |
12 | 4510000 |
13 | 29762a0 |
14 | 1a7ba00 |
15 | 125dadc |
hex | c98d00 |
13208832 has 270 divisors, whose sum is σ = 49341138. Its totient is φ = 3483648.
The previous prime is 13208827. The next prime is 13208851. The reversal of 13208832 is 23880231.
It can be written as a sum of positive squares in only one way, i.e., 9144576 + 4064256 = 3024^2 + 2016^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 13208796 and 13208805.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 1016058 + ... + 1016070.
Almost surely, 213208832 is an apocalyptic number.
13208832 is a gapful number since it is divisible by the number (12) 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 13208832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24670569).
13208832 is an abundant number, since it is smaller than the sum of its proper divisors (36132306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13208832 is an equidigital number, since it uses as much as digits as its factorization.
13208832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55 (or 25 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 13208832 is about 3634.3956856677. The cubic root of 13208832 is about 236.3858477961.
The spelling of 13208832 in words is "thirteen million, two hundred eight thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •