Base | Representation |
---|---|
bin | 110000000101… |
… | …001011111001 |
3 | 212201100122111 |
4 | 300011023321 |
5 | 11211313103 |
6 | 1130052321 |
7 | 212063542 |
oct | 60051371 |
9 | 25640574 |
10 | 12604153 |
11 | 7129761 |
12 | 427a0a1 |
13 | 27c3ca3 |
14 | 19614c9 |
15 | 118e86d |
hex | c052f9 |
12604153 has 4 divisors (see below), whose sum is σ = 12635380. Its totient is φ = 12572928.
The previous prime is 12604099. The next prime is 12604159. The reversal of 12604153 is 35140621.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35140621 = 2609 ⋅13469.
It can be written as a sum of positive squares in 2 ways, for example, as 5697769 + 6906384 = 2387^2 + 2628^2 .
It is a cyclic number.
It is not a de Polignac number, because 12604153 - 217 = 12473081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12604159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15000 + ... + 15817.
It is an arithmetic number, because the mean of its divisors is an integer number (3158845).
Almost surely, 212604153 is an apocalyptic number.
It is an amenable number.
12604153 is a deficient number, since it is larger than the sum of its proper divisors (31227).
12604153 is an equidigital number, since it uses as much as digits as its factorization.
12604153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31226.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 12604153 is about 3550.2328092676. The cubic root of 12604153 is about 232.7222401912.
Adding to 12604153 its reverse (35140621), we get a palindrome (47744774).
The spelling of 12604153 in words is "twelve million, six hundred four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •