Base | Representation |
---|---|
bin | 110000100000… |
… | …010010000101 |
3 | 212220222220011 |
4 | 300200102011 |
5 | 11223341031 |
6 | 1132310221 |
7 | 213035245 |
oct | 60402205 |
9 | 25828804 |
10 | 12715141 |
11 | 71a508a |
12 | 4312371 |
13 | 283266a |
14 | 198db25 |
15 | 11b26b1 |
hex | c20485 |
12715141 has 4 divisors (see below), whose sum is σ = 12793312. Its totient is φ = 12636972.
The previous prime is 12715139. The next prime is 12715147. The reversal of 12715141 is 14151721.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14151721 = 233 ⋅60737.
It is a cyclic number.
It is not a de Polignac number, because 12715141 - 21 = 12715139 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 (12715147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38841 + ... + 39166.
It is an arithmetic number, because the mean of its divisors is an integer number (3198328).
Almost surely, 212715141 is an apocalyptic number.
It is an amenable number.
12715141 is a deficient number, since it is larger than the sum of its proper divisors (78171).
12715141 is an equidigital number, since it uses as much as digits as its factorization.
12715141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78170.
The product of its digits is 280, while the sum is 22.
The square root of 12715141 is about 3565.8296369849. The cubic root of 12715141 is about 233.4033365923.
Adding to 12715141 its reverse (14151721), we get a palindrome (26866862).
The spelling of 12715141 in words is "twelve million, seven hundred fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •