Base | Representation |
---|---|
bin | 110010100110… |
… | …111000110000 |
3 | 220222000012010 |
4 | 302212320300 |
5 | 11344011410 |
6 | 1152202520 |
7 | 220522533 |
oct | 62467060 |
9 | 26860163 |
10 | 13266480 |
11 | 7541337 |
12 | 4539440 |
13 | 29965b6 |
14 | 1a94a1a |
15 | 1270c20 |
hex | ca6e30 |
13266480 has 80 divisors (see below), whose sum is σ = 41497344. Its totient is φ = 3505920.
The previous prime is 13266479. The next prime is 13266497. The reversal of 13266480 is 8466231.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39915 + ... + 40245.
Almost surely, 213266480 is an apocalyptic number.
13266480 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 13266480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20748672).
13266480 is an abundant number, since it is smaller than the sum of its proper divisors (28230864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13266480 is a wasteful number, since it uses less digits than its factorization.
13266480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514 (or 508 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
The square root of 13266480 is about 3642.3179432883. The cubic root of 13266480 is about 236.7292391141.
The spelling of 13266480 in words is "thirteen million, two hundred sixty-six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •