Base | Representation |
---|---|
bin | 110011010101… |
… | …101000111100 |
3 | 221022201212201 |
4 | 303111220330 |
5 | 11421123410 |
6 | 1200241244 |
7 | 222251044 |
oct | 63255074 |
9 | 27281781 |
10 | 13457980 |
11 | 76621a8 |
12 | 4610224 |
13 | 2a32803 |
14 | 1b04724 |
15 | 12ac83a |
hex | cd5a3c |
13457980 has 48 divisors (see below), whose sum is σ = 29352960. Its totient is φ = 5179968.
The previous prime is 13457971. The next prime is 13457987. The reversal of 13457980 is 8975431.
It is a super-2 number, since 2×134579802 = 362234451360800, which contains 22 as substring.
It is a Smith number, since the sum of its digits (37) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13457987) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 96751 + ... + 96889.
It is an arithmetic number, because the mean of its divisors is an integer number (611520).
Almost surely, 213457980 is an apocalyptic number.
13457980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13457980 is an abundant number, since it is smaller than the sum of its proper divisors (15894980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13457980 is a wasteful number, since it uses less digits than its factorization.
13457980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298 (or 296 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 37.
The square root of 13457980 is about 3668.5119599096. The cubic root of 13457980 is about 237.8628543948.
The spelling of 13457980 in words is "thirteen million, four hundred fifty-seven thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •