Base | Representation |
---|---|
bin | 101111001000… |
… | …110101001101 |
3 | 212020210112111 |
4 | 233020311031 |
5 | 11130410231 |
6 | 1120504021 |
7 | 210014032 |
oct | 57106515 |
9 | 25223474 |
10 | 12356941 |
11 | 6a7aa53 |
12 | 417b011 |
13 | 27385cc |
14 | 18d9389 |
15 | 11414b1 |
hex | bc8d4d |
12356941 has 4 divisors (see below), whose sum is σ = 12755584. Its totient is φ = 11958300.
The previous prime is 12356933. The next prime is 12356947. The reversal of 12356941 is 14965321.
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.
It is a cyclic number.
It is not a de Polignac number, because 12356941 - 23 = 12356933 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 398611 = 12356941 / (1 + 2 + 3 + 5 + 6 + 9 + 4 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12356947) 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 3 ways as a sum of consecutive naturals, for example, 199275 + ... + 199336.
It is an arithmetic number, because the mean of its divisors is an integer number (3188896).
Almost surely, 212356941 is an apocalyptic number.
It is an amenable number.
12356941 is a deficient number, since it is larger than the sum of its proper divisors (398643).
12356941 is an equidigital number, since it uses as much as digits as its factorization.
12356941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398642.
The product of its digits is 6480, while the sum is 31.
The square root of 12356941 is about 3515.2440882533. The cubic root of 12356941 is about 231.1906810598.
The spelling of 12356941 in words is "twelve million, three hundred fifty-six thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •