Search a number
-
+
101505040044509 is a prime number
BaseRepresentation
bin10111000101000101111011…
…110110101101000111011101
3111022101210020202200110022102
4113011011323312231013131
5101301024310222411014
6555514434402054445
730244332342350153
oct2705057366550735
9438353222613272
10101505040044509
112a385055968602
12b47443464a425
134483b6579bcba
141b0cc279a53d3
15bb05a43808de
hex5c517bdad1dd

101505040044509 has 2 divisors, whose sum is σ = 101505040044510. Its totient is φ = 101505040044508.

The previous prime is 101505040044469. The next prime is 101505040044547. The reversal of 101505040044509 is 905440040505101.

It is an a-pointer prime, because the next prime (101505040044547) can be obtained adding 101505040044509 to its sum of digits (38).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 73385299176484 + 28119740868025 = 8566522^2 + 5302805^2 .

It is a cyclic number.

It is not a de Polignac number, because 101505040044509 - 28 = 101505040044253 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2101505040044509 is an apocalyptic number.

It is an amenable number.

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

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

101505040044509 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 72000, while the sum is 38.

The spelling of 101505040044509 in words is "one hundred one trillion, five hundred five billion, forty million, forty-four thousand, five hundred nine".