Base | Representation |
---|---|
bin | 110000110011… |
… | …111000101110 |
3 | 220002002001010 |
4 | 300303320232 |
5 | 11233423223 |
6 | 1134130050 |
7 | 213521325 |
oct | 60637056 |
9 | 26062033 |
10 | 12795438 |
11 | 724a447 |
12 | 4350926 |
13 | 2860086 |
14 | 19b10bc |
15 | 11cb393 |
hex | c33e2e |
12795438 has 32 divisors (see below), whose sum is σ = 26703360. Its totient is φ = 4082400.
The previous prime is 12795437. The next prime is 12795439. The reversal of 12795438 is 83459721.
It is an interprime number because it is at equal distance from previous prime (12795437) and next prime (12795439).
It is a super-2 number, since 2×127954382 = 327446467223688, which contains 22 as substring.
Its product of digits (60480) is a multiple of the sum of its prime divisors (672).
It is a junction number, because it is equal to n+sod(n) for n = 12795396 and 12795405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12795437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26031 + ... + 26517.
It is an arithmetic number, because the mean of its divisors is an integer number (834480).
Almost surely, 212795438 is an apocalyptic number.
12795438 is an abundant number, since it is smaller than the sum of its proper divisors (13907922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12795438 is a wasteful number, since it uses less digits than its factorization.
12795438 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672.
The product of its digits is 60480, while the sum is 39.
The square root of 12795438 is about 3577.0711483000. The cubic root of 12795438 is about 233.8936254029.
The spelling of 12795438 in words is "twelve million, seven hundred ninety-five thousand, four hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •