Search a number
-
+
1000128152929 is a prime number
BaseRepresentation
bin11101000110111000100…
…10001000010101100001
310112121111122120021020211
432203130102020111201
5112341230301343204
62043241425134121
7132154052014513
oct16433422102541
93477448507224
101000128152929
113561742a6104
121419b8a8a341
13734089b8689
1436599485bb3
151b037b2c804
hexe8dc488561

1000128152929 has 2 divisors, whose sum is σ = 1000128152930. Its totient is φ = 1000128152928.

The previous prime is 1000128152909. The next prime is 1000128153047. The reversal of 1000128152929 is 9292518210001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 915360995025 + 84767157904 = 956745^2 + 291148^2 .

It is a cyclic number.

It is not a de Polignac number, because 1000128152929 - 223 = 1000119764321 is a prime.

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

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

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

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

Almost surely, 21000128152929 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25920, while the sum is 40.

The spelling of 1000128152929 in words is "one trillion, one hundred twenty-eight million, one hundred fifty-two thousand, nine hundred twenty-nine".