Search a number
-
+
1462740341 is a prime number
BaseRepresentation
bin101011100101111…
…1010010101110101
310202221101220112012
41113023322111311
510443430142331
6401051334005
751151042046
oct12713722565
93687356465
101462740341
11690751517
12349a51305
131a4077b3a
14dc3a48cd
158863982b
hex572fa575

1462740341 has 2 divisors, whose sum is σ = 1462740342. Its totient is φ = 1462740340.

The previous prime is 1462740337. The next prime is 1462740413. The reversal of 1462740341 is 1430472641.

Together with next prime (1462740413) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 870840100 + 591900241 = 29510^2 + 24329^2 .

It is a cyclic number.

It is not a de Polignac number, because 1462740341 - 22 = 1462740337 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1462740298 and 1462740307.

It is a congruent number.

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

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

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

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

Almost surely, 21462740341 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1462740341 is about 38245.7885393935. The cubic root of 1462740341 is about 1135.1565157700.

The spelling of 1462740341 in words is "one billion, four hundred sixty-two million, seven hundred forty thousand, three hundred forty-one".