Search a number
-
+
35424654010507 is a prime number
BaseRepresentation
bin10000000110111111100011…
…11010110010100010001011
311122102120020001020202100101
420003133301322302202023
514120344142411314012
6203201510020550231
710314226643602126
oct1003376172624213
9148376201222311
1035424654010507
1110318569740a03
123b81650b52377
13169c6b8797438
148a67c33373bd
15416723520d57
hex2037f1eb288b

35424654010507 has 2 divisors, whose sum is σ = 35424654010508. Its totient is φ = 35424654010506.

The previous prime is 35424654010453. The next prime is 35424654010583. The reversal of 35424654010507 is 70501045642453.

35424654010507 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 35424654010507 - 27 = 35424654010379 is a prime.

It is a super-3 number, since 3×354246540105073 (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 (35424654010307) by changing a digit.

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

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

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

Almost surely, 235424654010507 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2016000, while the sum is 46.

The spelling of 35424654010507 in words is "thirty-five trillion, four hundred twenty-four billion, six hundred fifty-four million, ten thousand, five hundred seven".