Base | Representation |
---|---|
bin | 101110101001… |
… | …000000000100 |
3 | 212000011200201 |
4 | 232221000010 |
5 | 11112222224 |
6 | 1114020244 |
7 | 205631650 |
oct | 56510004 |
9 | 25004621 |
10 | 12226564 |
11 | 69a0aa9 |
12 | 4117684 |
13 | 26c116c |
14 | 18a3a60 |
15 | 1117a44 |
hex | ba9004 |
12226564 has 24 divisors (see below), whose sum is σ = 24752448. Its totient is φ = 5175840.
The previous prime is 12226561. The next prime is 12226573. The reversal of 12226564 is 46562221.
12226564 = T497 + T498 + ... + T580.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a plaindrome in base 5.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12226561) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 307 + ... + 4954.
It is an arithmetic number, because the mean of its divisors is an integer number (1031352).
Almost surely, 212226564 is an apocalyptic number.
12226564 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
12226564 is an abundant number, since it is smaller than the sum of its proper divisors (12525884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12226564 is a wasteful number, since it uses less digits than its factorization.
12226564 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5355 (or 5353 counting only the distinct ones).
The product of its digits is 5760, while the sum is 28.
The square root of 12226564 is about 3496.6503971658. The cubic root of 12226564 is about 230.3747137003.
Adding to 12226564 its reverse (46562221), we get a palindrome (58788785).
It can be divided in two parts, 1222 and 6564, that multiplied together give a palindrome (8021208).
The spelling of 12226564 in words is "twelve million, two hundred twenty-six thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •