Search a number
-
+
101304213961 is a prime number
BaseRepresentation
bin101111001011000110…
…0111010000111001001
3100200111001202021110111
41132112030322013021
53124432334321321
6114312152514321
710214261416366
oct1362614720711
9320431667414
10101304213961
1139a65651385
12177726ab9a1
139725a91792
144c9035b46d
15297d9ad5e1
hex179633a1c9

101304213961 has 2 divisors, whose sum is σ = 101304213962. Its totient is φ = 101304213960.

The previous prime is 101304213949. The next prime is 101304214013. The reversal of 101304213961 is 169312403101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 80418183561 + 20886030400 = 283581^2 + 144520^2 .

It is a cyclic number.

It is not a de Polignac number, because 101304213961 - 215 = 101304181193 is a prime.

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

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

Almost surely, 2101304213961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 31.

The spelling of 101304213961 in words is "one hundred one billion, three hundred four million, two hundred thirteen thousand, nine hundred sixty-one".