Search a number
-
+
10505643437 is a prime number
BaseRepresentation
bin10011100100010111…
…10110010110101101
31000010011012222112002
421302023312112231
5133003421042222
64454244222045
7521224332032
oct116213662655
930104188462
1010505643437
114501186453
12205239a925
13cb569a183
14719387389
1541748d392
hex2722f65ad

10505643437 has 2 divisors, whose sum is σ = 10505643438. Its totient is φ = 10505643436.

The previous prime is 10505643409. The next prime is 10505643469. The reversal of 10505643437 is 73434650501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6673909636 + 3831733801 = 81694^2 + 61901^2 .

It is a cyclic number.

It is not a de Polignac number, because 10505643437 - 212 = 10505639341 is a prime.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10505643497) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5252821718 + 5252821719.

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

Almost surely, 210505643437 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 151200, while the sum is 38.

The spelling of 10505643437 in words is "ten billion, five hundred five million, six hundred forty-three thousand, four hundred thirty-seven".