Base | Representation |
---|---|
bin | 110011101110… |
… | …110011100100 |
3 | 221111222021111 |
4 | 303232303210 |
5 | 11432423220 |
6 | 1202354404 |
7 | 223160422 |
oct | 63566344 |
9 | 27458244 |
10 | 13561060 |
11 | 7722697 |
12 | 465ba04 |
13 | 2a6a6c6 |
14 | 1b30112 |
15 | 12cd15a |
hex | ceece4 |
13561060 has 48 divisors (see below), whose sum is σ = 30320640. Its totient is φ = 5080320.
The previous prime is 13561049. The next prime is 13561081. The reversal of 13561060 is 6016531.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48120 + ... + 48400.
It is an arithmetic number, because the mean of its divisors is an integer number (631680).
Almost surely, 213561060 is an apocalyptic number.
13561060 is a gapful number since it is divisible by the number (10) 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 13561060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15160320).
13561060 is an abundant number, since it is smaller than the sum of its proper divisors (16759580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13561060 is a wasteful number, since it uses less digits than its factorization.
13561060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 436 (or 434 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 13561060 is about 3682.5344533351. The cubic root of 13561060 is about 238.4686057299.
Adding to 13561060 its reverse (6016531), we get a palindrome (19577591).
It can be divided in two parts, 1356 and 1060, that multiplied together give a triangular number (1437360 = T1695).
The spelling of 13561060 in words is "thirteen million, five hundred sixty-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •