Search a number
-
+
102714699151 is a prime number
BaseRepresentation
bin101111110101001000…
…1011110110110001111
3100211010100211100101201
41133222101132312033
53140324430333101
6115104140250331
710264236352201
oct1375221366617
9324110740351
10102714699151
113a619851819
1217aa6b409a7
1398bc0718bc
144d857dc771
152a12724e01
hex17ea45ed8f

102714699151 has 2 divisors, whose sum is σ = 102714699152. Its totient is φ = 102714699150.

The previous prime is 102714699149. The next prime is 102714699173. The reversal of 102714699151 is 151996417201.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 102714699151 - 21 = 102714699149 is a prime.

Together with 102714699149, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (102714690151) 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, 51357349575 + 51357349576.

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

Almost surely, 2102714699151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 136080, while the sum is 46.

The spelling of 102714699151 in words is "one hundred two billion, seven hundred fourteen million, six hundred ninety-nine thousand, one hundred fifty-one".