Search a number
-
+
14369346241 is a prime number
BaseRepresentation
bin11010110000111101…
…01101001011000001
31101002102110102100221
431120132231023001
5213412023034431
610333504543041
71016041266505
oct153036551301
941072412327
1014369346241
116104137568
122950321a81
13147cca9a53
149a457c305
1559178e111
hex3587ad2c1

14369346241 has 2 divisors, whose sum is σ = 14369346242. Its totient is φ = 14369346240.

The previous prime is 14369346217. The next prime is 14369346253. The reversal of 14369346241 is 14264396341.

14369346241 is digitally balanced in base 2, 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., 9622825216 + 4746521025 = 98096^2 + 68895^2 .

It is a cyclic number.

It is not a de Polignac number, because 14369346241 - 27 = 14369346113 is a prime.

It is a super-2 number, since 2×143693462412 (a number of 21 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (14369346841) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7184673120 + 7184673121.

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

Almost surely, 214369346241 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 373248, while the sum is 43.

The spelling of 14369346241 in words is "fourteen billion, three hundred sixty-nine million, three hundred forty-six thousand, two hundred forty-one".