Search a number
-
+
100560501053 is a prime number
BaseRepresentation
bin101110110100111011…
…1110111100100111101
3100121120020022202010222
41131221313313210331
53121421442013203
6114110304311125
710156661104235
oct1355167674475
9317506282128
10100560501053
1139713865911
12175a56124a5
13963798887c
144c1d684cc5
152938554038
hex1769df793d

100560501053 has 2 divisors, whose sum is σ = 100560501054. Its totient is φ = 100560501052.

The previous prime is 100560501043. The next prime is 100560501079. The reversal of 100560501053 is 350105065001.

It is an a-pointer prime, because the next prime (100560501079) can be obtained adding 100560501053 to its sum of digits (26).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 79252384324 + 21308116729 = 281518^2 + 145973^2 .

It is a cyclic number.

It is not a de Polignac number, because 100560501053 - 24 = 100560501037 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2100560501053 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 100560501053 its reverse (350105065001), we get a palindrome (450665566054).

The spelling of 100560501053 in words is "one hundred billion, five hundred sixty million, five hundred one thousand, fifty-three".