Search a number
-
+
101557933357 is a prime number
BaseRepresentation
bin101111010010101010…
…0110001010100101101
3100201010202011120001011
41132211110301110231
53130442312331412
6114353254545221
710223462122156
oct1364524612455
9321122146034
10101557933357
113a085895531
1217823668211
1397665070ba
144cb5d2492d
152995dc97a7
hex17a553152d

101557933357 has 2 divisors, whose sum is σ = 101557933358. Its totient is φ = 101557933356.

The previous prime is 101557933307. The next prime is 101557933363. The reversal of 101557933357 is 753339755101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 76102049956 + 25455883401 = 275866^2 + 159549^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 101557933357 - 219 = 101557409069 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2101557933357 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1488375, while the sum is 49.

The spelling of 101557933357 in words is "one hundred one billion, five hundred fifty-seven million, nine hundred thirty-three thousand, three hundred fifty-seven".