Search a number
-
+
101501545469 is a prime number
BaseRepresentation
bin101111010000111110…
…1101010101111111101
3100200222211001202101212
41132201331222233331
53130333343423334
6114343522214205
710222205621042
oct1364175525775
9320884052355
10101501545469
113a056a81475
12178087b4365
13975792329c
144cac6471c9
152990e8bece
hex17a1f6abfd

101501545469 has 2 divisors, whose sum is σ = 101501545470. Its totient is φ = 101501545468.

The previous prime is 101501545429. The next prime is 101501545477. The reversal of 101501545469 is 964545105101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 77643036025 + 23858509444 = 278645^2 + 154462^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 101501545469 - 28 = 101501545213 is a prime.

It is a super-2 number, since 2×1015015454692 (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 (101501545429) by changing a digit.

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

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

Almost surely, 2101501545469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108000, while the sum is 41.

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