Search a number
-
+
101630206577 is a prime number
BaseRepresentation
bin101111010100110100…
…0011110001001110001
3100201022210011102021002
41132221220132021301
53131114313102302
6114404400011345
710225330334234
oct1365150361161
9321283142232
10101630206577
113a112669469
1217843900b55
139778490513
144cc177941b
15299c403c02
hex17a9a1e271

101630206577 has 2 divisors, whose sum is σ = 101630206578. Its totient is φ = 101630206576.

The previous prime is 101630206511. The next prime is 101630206589. The reversal of 101630206577 is 775602036101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 93675172096 + 7955034481 = 306064^2 + 89191^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 101630206577 - 212 = 101630202481 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (101630206877) 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, 50815103288 + 50815103289.

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

Almost surely, 2101630206577 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 101630206577 in words is "one hundred one billion, six hundred thirty million, two hundred six thousand, five hundred seventy-seven".