Search a number
-
+
10142464500227 is a prime number
BaseRepresentation
bin1001001110010111100111…
…1111100110001000000011
31022220121110210022201022202
42103211321333212020003
52312133231403001402
633323214525423415
72064524503536413
oct223457177461003
938817423281282
1010142464500227
113260438884704
121179816a0ab6b
1358757949a577
14270c7dbaa643
15128c671cbb02
hex93979fe6203

10142464500227 has 2 divisors, whose sum is σ = 10142464500228. Its totient is φ = 10142464500226.

The previous prime is 10142464500173. The next prime is 10142464500257. The reversal of 10142464500227 is 72200546424101.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 10142464500227 - 214 = 10142464483843 is a prime.

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

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

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

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

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

Almost surely, 210142464500227 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 107520, while the sum is 38.

The spelling of 10142464500227 in words is "ten trillion, one hundred forty-two billion, four hundred sixty-four million, five hundred thousand, two hundred twenty-seven".