Search a number
-
+
39503875969 is a prime number
BaseRepresentation
bin100100110010100111…
…010100111110000001
310202222002111211021101
4210302213110332001
51121400443012334
630051533054401
72565641256025
oct446247247601
9122862454241
1039503875969
11158319a9788
1277a5927401
13395735674c
141caa744385
151063187214
hex9329d4f81

39503875969 has 2 divisors, whose sum is σ = 39503875970. Its totient is φ = 39503875968.

The previous prime is 39503875913. The next prime is 39503876053. The reversal of 39503875969 is 96957830593.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 39080545344 + 423330625 = 197688^2 + 20575^2 .

It is a cyclic number.

It is not a de Polignac number, because 39503875969 - 219 = 39503351681 is a prime.

It is a super-2 number, since 2×395038759692 (a number of 22 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 39503875969.

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

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

Almost surely, 239503875969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 55112400, while the sum is 64.

The spelling of 39503875969 in words is "thirty-nine billion, five hundred three million, eight hundred seventy-five thousand, nine hundred sixty-nine".