Search a number
-
+
12307469 is a prime number
BaseRepresentation
bin101110111100…
…110000001101
3212011021200012
4232330300031
511122314334
61115443005
7206416556
oct56746015
925137605
1012307469
116a46869
124156465
13271bc35
1418c532d
1511319ce
hexbbcc0d

12307469 has 2 divisors, whose sum is σ = 12307470. Its totient is φ = 12307468.

The previous prime is 12307453. The next prime is 12307481. The reversal of 12307469 is 96470321.

12307469 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7086244 + 5221225 = 2662^2 + 2285^2 .

It is an emirp because it is prime and its reverse (96470321) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 12307469 - 24 = 12307453 is a prime.

It is a super-2 number, since 2×123074692 = 302947586371922, which contains 22 as substring.

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (12307409) 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 as a sum of consecutive naturals, namely, 6153734 + 6153735.

It is an arithmetic number, because the mean of its divisors is an integer number (6153735).

Almost surely, 212307469 is an apocalyptic number.

It is an amenable number.

12307469 is a deficient number, since it is larger than the sum of its proper divisors (1).

12307469 is an equidigital number, since it uses as much as digits as its factorization.

12307469 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 9072, while the sum is 32.

The square root of 12307469 is about 3508.2002508409. The cubic root of 12307469 is about 230.8817382825.

The spelling of 12307469 in words is "twelve million, three hundred seven thousand, four hundred sixty-nine".