Base | Representation |
---|---|
bin | 110010101100… |
… | …001101001010 |
3 | 221000010002000 |
4 | 302230031022 |
5 | 11400211031 |
6 | 1152451430 |
7 | 220643205 |
oct | 62541512 |
9 | 27003060 |
10 | 13288266 |
11 | 7556742 |
12 | 4549b76 |
13 | 29a34a4 |
14 | 1a9c93c |
15 | 12773e6 |
hex | cac34a |
13288266 has 32 divisors (see below), whose sum is σ = 30093120. Its totient is φ = 4344912.
The previous prime is 13288259. The next prime is 13288307. The reversal of 13288266 is 66288231.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13288266.
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, 541 + ... + 5183.
It is an arithmetic number, because the mean of its divisors is an integer number (940410).
Almost surely, 213288266 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13288266, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15046560).
13288266 is an abundant number, since it is smaller than the sum of its proper divisors (16804854).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13288266 is a wasteful number, since it uses less digits than its factorization.
13288266 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4707 (or 4701 counting only the distinct ones).
The product of its digits is 27648, while the sum is 36.
The square root of 13288266 is about 3645.3073944456. The cubic root of 13288266 is about 236.8587525609.
The spelling of 13288266 in words is "thirteen million, two hundred eighty-eight thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •