Base | Representation |
---|---|
bin | 110010100011… |
… | …001100000010 |
3 | 220221020102000 |
4 | 302203030002 |
5 | 11343020310 |
6 | 1152004430 |
7 | 220430421 |
oct | 62431402 |
9 | 26836360 |
10 | 13251330 |
11 | 7530a14 |
12 | 4530716 |
13 | 298c731 |
14 | 1a8d2b8 |
15 | 126b4c0 |
hex | ca3302 |
13251330 has 64 divisors (see below), whose sum is σ = 37428480. Its totient is φ = 3324672.
The previous prime is 13251319. The next prime is 13251349. The reversal of 13251330 is 3315231.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
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, 3147 + ... + 6033.
It is an arithmetic number, because the mean of its divisors is an integer number (584820).
Almost surely, 213251330 is an apocalyptic number.
13251330 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 13251330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18714240).
13251330 is an abundant number, since it is smaller than the sum of its proper divisors (24177150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13251330 is a wasteful number, since it uses less digits than its factorization.
13251330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2920 (or 2914 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 18.
The square root of 13251330 is about 3640.2376296061. The cubic root of 13251330 is about 236.6390917640.
Adding to 13251330 its reverse (3315231), we get a palindrome (16566561).
The spelling of 13251330 in words is "thirteen million, two hundred fifty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •