Search a number
-
+
10701406409 is a prime number
BaseRepresentation
bin10011111011101101…
…01000000011001001
31000121210120202211112
421331312220003021
5133404030001114
64525520140105
7526122311411
oct117566500311
930553522745
1010701406409
1145a1735031
1220a7a67635
1310170cca55
14737385641
1542975c13e
hex27dda80c9

10701406409 has 2 divisors, whose sum is σ = 10701406410. Its totient is φ = 10701406408.

The previous prime is 10701406393. The next prime is 10701406411. The reversal of 10701406409 is 90460410701.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7930436809 + 2770969600 = 89053^2 + 52640^2 .

It is a cyclic number.

It is not a de Polignac number, because 10701406409 - 24 = 10701406393 is a prime.

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

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

It is a Chen prime.

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

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

Almost surely, 210701406409 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6048, while the sum is 32.

The spelling of 10701406409 in words is "ten billion, seven hundred one million, four hundred six thousand, four hundred nine".