Search a number
-
+
35671505448961 is a prime number
BaseRepresentation
bin10000001110001011010110…
…11010010011000000000001
311200022011101112210010000001
420013011223122103000001
514133420220343331321
6203511132520000001
710341116105320144
oct1007055332230001
9150264345703001
1035671505448961
1110403222965278
124001463000001
1316b9a68457855
148b471d91005b
1541cd6ebecc91
hex20716b693001

35671505448961 has 2 divisors, whose sum is σ = 35671505448962. Its totient is φ = 35671505448960.

The previous prime is 35671505448949. The next prime is 35671505448977. The reversal of 35671505448961 is 16984450517653.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 32859951169600 + 2811554279361 = 5732360^2 + 1676769^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 235671505448961 is an apocalyptic number.

It is an amenable number.

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

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

35671505448961 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 35671505448961 in words is "thirty-five trillion, six hundred seventy-one billion, five hundred five million, four hundred forty-eight thousand, nine hundred sixty-one".