Base | Representation |
---|---|
bin | 110000011010… |
… | …110111010110 |
3 | 212212212110021 |
4 | 300122313112 |
5 | 11222133300 |
6 | 1132015354 |
7 | 212613454 |
oct | 60326726 |
9 | 25785407 |
10 | 12692950 |
11 | 718a446 |
12 | 430155a |
13 | 282552a |
14 | 19859d4 |
15 | 11aad1a |
hex | c1add6 |
12692950 has 48 divisors (see below), whose sum is σ = 25712640. Its totient is φ = 4644000.
The previous prime is 12692929. The next prime is 12692957. The reversal of 12692950 is 5929621.
It is a super-2 number, since 2×126929502 = 322221959405000, which contains 22 as substring.
It is a Smith number, since the sum of its digits (34) 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 (12692957) 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 23 ways as a sum of consecutive naturals, for example, 29235 + ... + 29665.
It is an arithmetic number, because the mean of its divisors is an integer number (535680).
Almost surely, 212692950 is an apocalyptic number.
12692950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12692950 is an abundant number, since it is smaller than the sum of its proper divisors (13019690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12692950 is a wasteful number, since it uses less digits than its factorization.
12692950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493 (or 488 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 34.
The square root of 12692950 is about 3562.7166600784. The cubic root of 12692950 is about 233.2674757447.
The spelling of 12692950 in words is "twelve million, six hundred ninety-two thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •