Search a number
-
+
38509235527681 is a prime number
BaseRepresentation
bin10001100000110001000010…
…10011011110000000000001
312001100110001211120021211201
420300120201103132000001
520021413403243341211
6213522522031541201
711053125520103602
oct1060304123360001
9161313054507751
1038509235527681
11112a7747581396
12439b42108a801
131864536677749
14971bdd653da9
1546baa85750c1
hex2306214de001

38509235527681 has 2 divisors, whose sum is σ = 38509235527682. Its totient is φ = 38509235527680.

The previous prime is 38509235527669. The next prime is 38509235527729. The reversal of 38509235527681 is 18672553290583.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 38228054557456 + 281180970225 = 6182884^2 + 530265^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-38509235527681 is a prime.

It is a super-3 number, since 3×385092355276813 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

Almost surely, 238509235527681 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 38509235527681 in words is "thirty-eight trillion, five hundred nine billion, two hundred thirty-five million, five hundred twenty-seven thousand, six hundred eighty-one".