Search a number
-
+
1020100111229 is a prime number
BaseRepresentation
bin11101101100000101011…
…01000110101101111101
310121112001112022212112002
432312002231012231331
5113203131112024404
62100343313352045
7133462013610263
oct16660255065575
93545045285462
101020100111229
11363692a11a71
12145851568625
137526c625794
1437531b4c433
151b8061a9c1e
hexed82b46b7d

1020100111229 has 2 divisors, whose sum is σ = 1020100111230. Its totient is φ = 1020100111228.

The previous prime is 1020100111183. The next prime is 1020100111259. The reversal of 1020100111229 is 9221110010201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 513625922329 + 506474188900 = 716677^2 + 711670^2 .

It is a cyclic number.

It is not a de Polignac number, because 1020100111229 - 28 = 1020100110973 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21020100111229 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72, while the sum is 20.

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