Base | Representation |
---|---|
bin | 110010111000… |
… | …011010011110 |
3 | 221002122200000 |
4 | 302320122132 |
5 | 11403311040 |
6 | 1153515130 |
7 | 221242041 |
oct | 62703236 |
9 | 27078600 |
10 | 13338270 |
11 | 7590270 |
12 | 4572aa6 |
13 | 29c018a |
14 | 1ab2c58 |
15 | 1287130 |
hex | cb869e |
13338270 has 96 divisors (see below), whose sum is σ = 39312000. Its totient is φ = 3227040.
The previous prime is 13338257. The next prime is 13338313. The reversal of 13338270 is 7283331.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 26481 + ... + 26979.
It is an arithmetic number, because the mean of its divisors is an integer number (409500).
Almost surely, 213338270 is an apocalyptic number.
13338270 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 13338270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19656000).
13338270 is an abundant number, since it is smaller than the sum of its proper divisors (25973730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13338270 is a wasteful number, since it uses less digits than its factorization.
13338270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532 (or 520 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 13338270 is about 3652.1596350653. The cubic root of 13338270 is about 237.1554820159.
The spelling of 13338270 in words is "thirteen million, three hundred thirty-eight thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •