Search a number
-
+
101052200569 is a prime number
BaseRepresentation
bin101111000011100101…
…1100011011001111001
3100122211111112200002011
41132013023203121321
53123423330404234
6114231151205521
710205111350435
oct1360713433171
9318744480064
10101052200569
1139946372a51
12177022168a1
1396b57c5828
144c68ab99c5
1529667ccb64
hex17872e3679

101052200569 has 2 divisors, whose sum is σ = 101052200570. Its totient is φ = 101052200568.

The previous prime is 101052200567. The next prime is 101052200603. The reversal of 101052200569 is 965002250101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 64205478544 + 36846722025 = 253388^2 + 191955^2 .

It is an emirp because it is prime and its reverse (965002250101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 101052200569 - 21 = 101052200567 is a prime.

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

Together with 101052200567, 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 101052200569.

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

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

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

Almost surely, 2101052200569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 31.

The spelling of 101052200569 in words is "one hundred one billion, fifty-two million, two hundred thousand, five hundred sixty-nine".