Search a number
-
+
1014728131 is a prime number
BaseRepresentation
bin111100011110111…
…000010111000011
32121201101112022101
4330132320113003
54034232300011
6244405051231
734101022024
oct7436702703
92551345271
101014728131
1148087329a
122439b6b17
131322c5b61
1498aa2c4b
155e1402c1
hex3c7b85c3

1014728131 has 2 divisors, whose sum is σ = 1014728132. Its totient is φ = 1014728130.

The previous prime is 1014728129. The next prime is 1014728149. The reversal of 1014728131 is 1318274101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1014728131 - 21 = 1014728129 is a prime.

It is a super-2 number, since 2×10147281312 = 2059346359685506322, which contains 22 as substring.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1014728131.

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

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

Almost surely, 21014728131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1344, while the sum is 28.

The square root of 1014728131 is about 31854.7976135464. The cubic root of 1014728131 is about 1004.8854703113.

The spelling of 1014728131 in words is "one billion, fourteen million, seven hundred twenty-eight thousand, one hundred thirty-one".