Base | Representation |
---|---|
bin | 110010011100… |
… | …001010101100 |
3 | 220212202221220 |
4 | 302130022230 |
5 | 11341110242 |
6 | 1151223340 |
7 | 220250526 |
oct | 62341254 |
9 | 26782856 |
10 | 13222572 |
11 | 7511350 |
12 | 4517b50 |
13 | 297c60c |
14 | 1a82a16 |
15 | 1262bec |
hex | c9c2ac |
13222572 has 48 divisors (see below), whose sum is σ = 34003200. Its totient is φ = 3965760.
The previous prime is 13222571. The next prime is 13222589. The reversal of 13222572 is 27522231.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (13222571) by changing a digit.
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, 13929 + ... + 14847.
It is an arithmetic number, because the mean of its divisors is an integer number (708400).
Almost surely, 213222572 is an apocalyptic number.
13222572 is a gapful number since it is divisible by the number (12) 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 13222572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17001600).
13222572 is an abundant number, since it is smaller than the sum of its proper divisors (20780628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13222572 is a wasteful number, since it uses less digits than its factorization.
13222572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1046 (or 1044 counting only the distinct ones).
The product of its digits is 1680, while the sum is 24.
The square root of 13222572 is about 3636.2854673416. The cubic root of 13222572 is about 236.4677832773.
The spelling of 13222572 in words is "thirteen million, two hundred twenty-two thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •