Search a number
-
+
39070661057 is a prime number
BaseRepresentation
bin100100011000110010…
…101111100111000001
310201211220100020010122
4210120302233213001
51120004042123212
625540535510025
72552131065551
oct443062574701
9121756306118
1039070661057
111562a407a2a
1276a4828315
1338b8685a6c
141c68db5161
15103a112272
hex918caf9c1

39070661057 has 2 divisors, whose sum is σ = 39070661058. Its totient is φ = 39070661056.

The previous prime is 39070661053. The next prime is 39070661093. The reversal of 39070661057 is 75016607093.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 35739524401 + 3331136656 = 189049^2 + 57716^2 .

It is a cyclic number.

It is not a de Polignac number, because 39070661057 - 22 = 39070661053 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 39070660999 and 39070661017.

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

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

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

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

Almost surely, 239070661057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 238140, while the sum is 44.

The spelling of 39070661057 in words is "thirty-nine billion, seventy million, six hundred sixty-one thousand, fifty-seven".