Search a number
-
+
10487354869 is a prime number
BaseRepresentation
bin10011100010001100…
…00101010111110101
31000001212210211022201
421301012011113311
5132434230323434
64452352224501
7520613021425
oct116106052765
930055724281
1010487354869
1144a1924a32
12204823b131
13cb1965a34
14716b86485
15415a79614
hex2711855f5

10487354869 has 2 divisors, whose sum is σ = 10487354870. Its totient is φ = 10487354868.

The previous prime is 10487354821. The next prime is 10487354903. The reversal of 10487354869 is 96845378401.

10487354869 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., 6939723025 + 3547631844 = 83305^2 + 59562^2 .

It is a cyclic number.

It is not a de Polignac number, because 10487354869 - 29 = 10487354357 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210487354869 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5806080, while the sum is 55.

The spelling of 10487354869 in words is "ten billion, four hundred eighty-seven million, three hundred fifty-four thousand, eight hundred sixty-nine".