Search a number
-
+
35499016961 is a prime number
BaseRepresentation
bin100001000011111010…
…000000001100000001
310101121222122220111222
4201003322000030001
51040200222020321
624150311044425
72364461444162
oct410372001401
9111558586458
1035499016961
11140672a6951
126a68670715
1334697234a5
141a0a8c7769
15dcb7a23ab
hex843e80301

35499016961 has 2 divisors, whose sum is σ = 35499016962. Its totient is φ = 35499016960.

The previous prime is 35499016913. The next prime is 35499016963. The reversal of 35499016961 is 16961099453.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 28851060736 + 6647956225 = 169856^2 + 81535^2 .

It is a cyclic number.

It is not a de Polignac number, because 35499016961 - 214 = 35499000577 is a prime.

It is a Sophie Germain prime.

Together with 35499016963, it forms a pair of twin primes.

It is a Chen prime.

It is a Curzon number.

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

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

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

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

Almost surely, 235499016961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1574640, while the sum is 53.

The spelling of 35499016961 in words is "thirty-five billion, four hundred ninety-nine million, sixteen thousand, nine hundred sixty-one".