Base | Representation |
---|---|
bin | 110000100111… |
… | …101000110111 |
3 | 212222112020002 |
4 | 300213220313 |
5 | 11230322041 |
6 | 1133101515 |
7 | 213222140 |
oct | 60475067 |
9 | 25875202 |
10 | 12745271 |
11 | 7215790 |
12 | 432789b |
13 | 28432a6 |
14 | 199aac7 |
15 | 11bb59b |
hex | c27a37 |
12745271 has 8 divisors (see below), whose sum is σ = 15890304. Its totient is φ = 9931320.
The previous prime is 12745259. The next prime is 12745283. The reversal of 12745271 is 17254721.
It is an interprime number because it is at equal distance from previous prime (12745259) and next prime (12745283).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12745271 - 210 = 12744247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12745171) 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 7 ways as a sum of consecutive naturals, for example, 82685 + ... + 82838.
It is an arithmetic number, because the mean of its divisors is an integer number (1986288).
Almost surely, 212745271 is an apocalyptic number.
12745271 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12745271 is a deficient number, since it is larger than the sum of its proper divisors (3145033).
12745271 is a wasteful number, since it uses less digits than its factorization.
12745271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165541.
The product of its digits is 3920, while the sum is 29.
The square root of 12745271 is about 3570.0519604062. The cubic root of 12745271 is about 233.5875499147.
Adding to 12745271 its reverse (17254721), we get a palindrome (29999992).
The spelling of 12745271 in words is "twelve million, seven hundred forty-five thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •