Search a number
-
+
201002303201129 is a prime number
BaseRepresentation
bin101101101100111101111110…
…111000011001111101101001
3222100200122002002221020000222
4231230331332320121331221
5202321210204104414004
61551255103333335425
760223636311046613
oct5554757670317551
9870618062836028
10201002303201129
1159055664046351
121a663714797575
138820588780911
14378c7c5ccddb3
1518387e7b0a7be
hexb6cf7ee19f69

201002303201129 has 2 divisors, whose sum is σ = 201002303201130. Its totient is φ = 201002303201128.

The previous prime is 201002303201113. The next prime is 201002303201257. The reversal of 201002303201129 is 921102303200102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 197988763439104 + 3013539762025 = 14070848^2 + 1735955^2 .

It is a cyclic number.

It is not a de Polignac number, because 201002303201129 - 24 = 201002303201113 is a prime.

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

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

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

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

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

Almost surely, 2201002303201129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 26.

The spelling of 201002303201129 in words is "two hundred one trillion, two billion, three hundred three million, two hundred one thousand, one hundred twenty-nine".