Base | Representation |
---|---|
bin | 101111101010… |
… | …100110010100 |
3 | 212111211021010 |
4 | 233222212110 |
5 | 11144322002 |
6 | 1123452220 |
7 | 211131210 |
oct | 57524624 |
9 | 25454233 |
10 | 12495252 |
11 | 7064960 |
12 | 4227070 |
13 | 2786553 |
14 | 1933940 |
15 | 116c46c |
hex | bea994 |
12495252 has 48 divisors (see below), whose sum is σ = 36352512. Its totient is φ = 3245280.
The previous prime is 12495211. The next prime is 12495253. The reversal of 12495252 is 25259421.
It is a super-2 number, since 2×124952522 = 312262645087008, which contains 22 as substring.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12495253) 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, 5838 + ... + 7685.
It is an arithmetic number, because the mean of its divisors is an integer number (757344).
Almost surely, 212495252 is an apocalyptic number.
12495252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12495252 is an abundant number, since it is smaller than the sum of its proper divisors (23857260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12495252 is a wasteful number, since it uses less digits than its factorization.
12495252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13548 (or 13546 counting only the distinct ones).
The product of its digits is 7200, while the sum is 30.
The square root of 12495252 is about 3534.8623735586. The cubic root of 12495252 is about 232.0500536077.
The spelling of 12495252 in words is "twelve million, four hundred ninety-five thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •