Search a number
-
+
101472037728377 is a prime number
BaseRepresentation
bin10111000100100111001100…
…110000110111000001111001
3111022021122001210000002110112
4113010213030300313001321
5101300004213124302002
6555451335515554105
730242053455321101
oct2704471460670171
9438248053002415
10101472037728377
112a37205aa21a78
12b469b6415b935
134480a063c13a4
141b0b3b6910201
15bae7c1da6852
hex5c49ccc37079

101472037728377 has 2 divisors, whose sum is σ = 101472037728378. Its totient is φ = 101472037728376.

The previous prime is 101472037728361. The next prime is 101472037728409. The reversal of 101472037728377 is 773827730274101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 63183119385961 + 38288918342416 = 7948781^2 + 6187804^2 .

It is a cyclic number.

It is not a de Polignac number, because 101472037728377 - 24 = 101472037728361 is a prime.

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

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

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

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

Almost surely, 2101472037728377 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 19361664, while the sum is 59.

The spelling of 101472037728377 in words is "one hundred one trillion, four hundred seventy-two billion, thirty-seven million, seven hundred twenty-eight thousand, three hundred seventy-seven".