Search a number
-
+
101580385567 is a prime number
BaseRepresentation
bin101111010011010101…
…0011010110100011111
3100201012022102020200111
41132212222122310133
53131014034314232
6114355420110451
710224154013413
oct1364652326437
9321168366614
10101580385567
113a097530181
121782b095427
13976b06872b
144cb8ccad43
152997d62047
hex17a6a9ad1f

101580385567 has 2 divisors, whose sum is σ = 101580385568. Its totient is φ = 101580385566.

The previous prime is 101580385559. The next prime is 101580385579. The reversal of 101580385567 is 765583085101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101580385567 - 23 = 101580385559 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2101580385567 is an apocalyptic number.

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

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

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

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

The spelling of 101580385567 in words is "one hundred one billion, five hundred eighty million, three hundred eighty-five thousand, five hundred sixty-seven".