Search a number
-
+
10570413169 is a prime number
BaseRepresentation
bin10011101100000101…
…11011010001110001
31000021200002121220001
421312002323101301
5133122011210134
64504520350001
7522642013051
oct116602732161
930250077801
1010570413169
1145347a4958
122070015301
13cc5c27164
14723c07561
1541ced4414
hex2760bb471

10570413169 has 2 divisors, whose sum is σ = 10570413170. Its totient is φ = 10570413168.

The previous prime is 10570413167. The next prime is 10570413181. The reversal of 10570413169 is 96131407501.

It is a happy number.

10570413169 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 can be written as a sum of positive squares in only one way, i.e., 10249537600 + 320875569 = 101240^2 + 17913^2 .

It is a cyclic number.

It is not a de Polignac number, because 10570413169 - 21 = 10570413167 is a prime.

It is a super-2 number, since 2×105704131692 (a number of 21 digits) contains 22 as substring.

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

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

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

Almost surely, 210570413169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 22680, while the sum is 37.

The spelling of 10570413169 in words is "ten billion, five hundred seventy million, four hundred thirteen thousand, one hundred sixty-nine".