Search a number
-
+
1014741602669 is a prime number
BaseRepresentation
bin11101100010000110101…
…00000001000101101101
310121000020002100102200002
432301003110001011231
5113111142322241134
62054055454114045
7133212146210324
oct16610324010555
93530202312602
101014741602669
113613931a91a3
121447b6aab925
13748c7421c62
14371842070bb
151b5e0a3887e
hexec4350116d

1014741602669 has 2 divisors, whose sum is σ = 1014741602670. Its totient is φ = 1014741602668.

The previous prime is 1014741602621. The next prime is 1014741602671. The reversal of 1014741602669 is 9662061474101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1013318049769 + 1423552900 = 1006637^2 + 37730^2 .

It is a cyclic number.

It is not a de Polignac number, because 1014741602669 - 224 = 1014724825453 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 21014741602669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 435456, while the sum is 47.

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