Search a number
-
+
10547022137 is a prime number
BaseRepresentation
bin10011101001010011…
…01100100100111001
31000020001002020102112
421310221230210321
5133100014202022
64502323142105
7522236131451
oct116451544471
930201066375
1010547022137
114522578923
122064214935
13cc1127402
14720a78d61
1541ae138e2
hex274a6c939

10547022137 has 2 divisors, whose sum is σ = 10547022138. Its totient is φ = 10547022136.

The previous prime is 10547022121. The next prime is 10547022181. The reversal of 10547022137 is 73122074501.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8831488576 + 1715533561 = 93976^2 + 41419^2 .

It is a cyclic number.

It is not a de Polignac number, because 10547022137 - 24 = 10547022121 is a prime.

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

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

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

Almost surely, 210547022137 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 10547022137 its reverse (73122074501), we get a palindrome (83669096638).

The spelling of 10547022137 in words is "ten billion, five hundred forty-seven million, twenty-two thousand, one hundred thirty-seven".