Base | Representation |
---|---|
bin | 110010100011… |
… | …100100100000 |
3 | 220221022120000 |
4 | 302203210200 |
5 | 11343043041 |
6 | 1152020000 |
7 | 220435116 |
oct | 62434440 |
9 | 26838500 |
10 | 13252896 |
11 | 7532108 |
12 | 4531600 |
13 | 2990367 |
14 | 1a8dab6 |
15 | 126bbb6 |
hex | ca3920 |
13252896 has 60 divisors (see below), whose sum is σ = 38984022. Its totient is φ = 4416768.
The previous prime is 13252879. The next prime is 13252927. The reversal of 13252896 is 69825231.
It can be written as a sum of positive squares in only one way, i.e., 13220496 + 32400 = 3636^2 + 180^2 .
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 13252896.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 36 + ... + 5148.
Almost surely, 213252896 is an apocalyptic number.
13252896 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 13252896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19492011).
13252896 is an abundant number, since it is smaller than the sum of its proper divisors (25731126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13252896 is an equidigital number, since it uses as much as digits as its factorization.
13252896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5135 (or 5118 counting only the distinct ones).
The product of its digits is 25920, while the sum is 36.
The square root of 13252896 is about 3640.4527190996. The cubic root of 13252896 is about 236.6484131484.
The spelling of 13252896 in words is "thirteen million, two hundred fifty-two thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •