Search a number
-
+
10500057151061 is a prime number
BaseRepresentation
bin1001100011001011110000…
…1011010011011001010101
31101011210111000222112120212
42120302330023103121111
52334013104112313221
634155354253135205
72132414130114062
oct230627413233125
941153430875525
1010500057151061
11338905a5869a5
121216b93a8a505
135b21c709659a
142842c3b8bc69
151331e5ab4b5b
hex98cbc2d3655

10500057151061 has 2 divisors, whose sum is σ = 10500057151062. Its totient is φ = 10500057151060.

The previous prime is 10500057151019. The next prime is 10500057151079. The reversal of 10500057151061 is 16015175000501.

10500057151061 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., 5355031040836 + 5145026110225 = 2314094^2 + 2268265^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 210500057151061 is an apocalyptic number.

It is an amenable number.

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

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

10500057151061 is an evil number, because the sum of its binary digits is even.

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

The spelling of 10500057151061 in words is "ten trillion, five hundred billion, fifty-seven million, one hundred fifty-one thousand, sixty-one".