Search a number
-
+
35125563260113 is a prime number
BaseRepresentation
bin1111111110010010011101…
…01110000111110011010001
311121100222012220020101120121
413333021032232013303101
514100444123143310423
6202412243324110241
710253511126301114
oct777111656076321
9147328186211517
1035125563260113
1110212738814367
123b336a0095381
13167a432150361
1489612cc7c57b
1540da6aab945d
hex1ff24eb87cd1

35125563260113 has 2 divisors, whose sum is σ = 35125563260114. Its totient is φ = 35125563260112.

The previous prime is 35125563260063. The next prime is 35125563260149. The reversal of 35125563260113 is 31106236552153.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 29815225550224 + 5310337709889 = 5460332^2 + 2304417^2 .

It is a cyclic number.

It is not a de Polignac number, because 35125563260113 - 213 = 35125563251921 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 35125563260113.

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

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

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

Almost surely, 235125563260113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486000, while the sum is 43.

The spelling of 35125563260113 in words is "thirty-five trillion, one hundred twenty-five billion, five hundred sixty-three million, two hundred sixty thousand, one hundred thirteen".