Base | Representation |
---|---|
bin | 110000110110… |
… | …011110100100 |
3 | 220002121121020 |
4 | 300312132210 |
5 | 11234243202 |
6 | 1134251140 |
7 | 213564300 |
oct | 60663644 |
9 | 26077536 |
10 | 12806052 |
11 | 7257416 |
12 | 4356ab0 |
13 | 2864b5c |
14 | 19b4d00 |
15 | 11ce5bc |
hex | c367a4 |
12806052 has 72 divisors (see below), whose sum is σ = 36005760. Its totient is φ = 3528000.
The previous prime is 12806041. The next prime is 12806077. The reversal of 12806052 is 25060821.
12806052 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16677 + ... + 17427.
It is an arithmetic number, because the mean of its divisors is an integer number (500080).
Almost surely, 212806052 is an apocalyptic number.
12806052 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 12806052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18002880).
12806052 is an abundant number, since it is smaller than the sum of its proper divisors (23199708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12806052 is a wasteful number, since it uses less digits than its factorization.
12806052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 801 (or 792 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 12806052 is about 3578.5544567604. The cubic root of 12806052 is about 233.9582802385.
Adding to 12806052 its reverse (25060821), we get a palindrome (37866873).
The spelling of 12806052 in words is "twelve million, eight hundred six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •