Base | Representation |
---|---|
bin | 110000100111… |
… | …110100110000 |
3 | 212222120021021 |
4 | 300213310300 |
5 | 11230333112 |
6 | 1133105224 |
7 | 213224305 |
oct | 60476460 |
9 | 25876237 |
10 | 12746032 |
11 | 7216312 |
12 | 4328214 |
13 | 2843740 |
14 | 199b0ac |
15 | 11bb907 |
hex | c27d30 |
12746032 has 40 divisors (see below), whose sum is σ = 26810784. Its totient is φ = 5835264.
The previous prime is 12746021. The next prime is 12746047. The reversal of 12746032 is 23064721.
It is a super-2 number, since 2×127460322 = 324922663490048, which contains 22 as substring.
It is a hoax number, since the sum of its digits (25) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 12745988 and 12746006.
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 7 ways as a sum of consecutive naturals, for example, 48333 + ... + 48595.
Almost surely, 212746032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12746032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13405392).
12746032 is an abundant number, since it is smaller than the sum of its proper divisors (14064752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12746032 is a wasteful number, since it uses less digits than its factorization.
12746032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 517 (or 511 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 25.
The square root of 12746032 is about 3570.1585398971. The cubic root of 12746032 is about 233.5921988700.
The spelling of 12746032 in words is "twelve million, seven hundred forty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •