Base | Representation |
---|---|
bin | 110010100000… |
… | …100001011010 |
3 | 220220200102120 |
4 | 302200201122 |
5 | 11342143120 |
6 | 1151442110 |
7 | 220353531 |
oct | 62404132 |
9 | 26820376 |
10 | 13240410 |
11 | 7523797 |
12 | 4526336 |
13 | 2987781 |
14 | 1a89318 |
15 | 1268140 |
hex | ca085a |
13240410 has 64 divisors (see below), whose sum is σ = 34283520. Its totient is φ = 3263040.
The previous prime is 13240391. The next prime is 13240421. The reversal of 13240410 is 1404231.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13240410.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21081 + ... + 21699.
It is an arithmetic number, because the mean of its divisors is an integer number (535680).
Almost surely, 213240410 is an apocalyptic number.
13240410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13240410, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17141760).
13240410 is an abundant number, since it is smaller than the sum of its proper divisors (21043110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13240410 is a wasteful number, since it uses less digits than its factorization.
13240410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683.
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 13240410 is about 3638.7374183912. The cubic root of 13240410 is about 236.5740716483.
Adding to 13240410 its reverse (1404231), we get a palindrome (14644641).
The spelling of 13240410 in words is "thirteen million, two hundred forty thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •