Search a number
-
+
10476561353 is a prime number
BaseRepresentation
bin10011100000111001…
…11010001111001001
31000001010111110101212
421300130322033021
5132423444430403
64451325022505
7520422205436
oct116034721711
930033443355
1010476561353
114496822675
1220446b4a35
13cac656c3b
14715576b8d
15414b464d8
hex27073a3c9

10476561353 has 2 divisors, whose sum is σ = 10476561354. Its totient is φ = 10476561352.

The previous prime is 10476561301. The next prime is 10476561371. The reversal of 10476561353 is 35316567401.

10476561353 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., 9122542144 + 1354019209 = 95512^2 + 36797^2 .

It is a cyclic number.

It is not a de Polignac number, because 10476561353 - 226 = 10409452489 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10476561353.

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

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

Almost surely, 210476561353 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 226800, while the sum is 41.

The spelling of 10476561353 in words is "ten billion, four hundred seventy-six million, five hundred sixty-one thousand, three hundred fifty-three".