Base | Representation |
---|---|
bin | 110010011100… |
… | …101100000100 |
3 | 220212212220000 |
4 | 302130230010 |
5 | 11341142313 |
6 | 1151241300 |
7 | 220260000 |
oct | 62345404 |
9 | 26785800 |
10 | 13224708 |
11 | 7512a12 |
12 | 4519230 |
13 | 2980593 |
14 | 1a83700 |
15 | 1263673 |
hex | c9cb04 |
13224708 has 150 divisors (see below), whose sum is σ = 42704046. Its totient is φ = 3556224.
The previous prime is 13224697. The next prime is 13224713. The reversal of 13224708 is 80742231.
It can be written as a sum of positive squares in only one way, i.e., 12446784 + 777924 = 3528^2 + 882^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 49 ways as a sum of consecutive naturals, for example, 777916 + ... + 777932.
Almost surely, 213224708 is an apocalyptic number.
13224708 is a gapful number since it is divisible by the number (18) 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 13224708, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21352023).
13224708 is an abundant number, since it is smaller than the sum of its proper divisors (29479338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13224708 is an equidigital number, since it uses as much as digits as its factorization.
13224708 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61 (or 29 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 13224708 is about 3636.5791617948. The cubic root of 13224708 is about 236.4805157469.
Adding to 13224708 its reverse (80742231), we get a palindrome (93966939).
The spelling of 13224708 in words is "thirteen million, two hundred twenty-four thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •