Search a number
-
+
10442767469 is a prime number
BaseRepresentation
bin10011011100110111…
…11111110001101101
3222221202220112220112
421232123333301231
5132341322024334
64444120425405
7516532026131
oct115633776155
928852815815
1010442767469
114479740842
122035318265
13ca5654164
14710c9b3c1
15411bbd4ce
hex26e6ffc6d

10442767469 has 2 divisors, whose sum is σ = 10442767470. Its totient is φ = 10442767468.

The previous prime is 10442767421. The next prime is 10442767471. The reversal of 10442767469 is 96476724401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6172144969 + 4270622500 = 78563^2 + 65350^2 .

It is an emirp because it is prime and its reverse (96476724401) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10442767469 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 210442767469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2032128, while the sum is 50.

The spelling of 10442767469 in words is "ten billion, four hundred forty-two million, seven hundred sixty-seven thousand, four hundred sixty-nine".