Search a number
-
+
10550010605137 is a prime number
BaseRepresentation
bin1001100110000101110110…
…1000100110111001010001
31101100120102101012221012121
42121201131220212321101
52340322410203331022
634234335153054241
72136133045346323
oct231413550467121
941316371187177
1010550010605137
1133a8263a48343
1212247b5257381
135b6b282ba133
142868a2243613
1513466b3132c7
hex9985da26e51

10550010605137 has 2 divisors, whose sum is σ = 10550010605138. Its totient is φ = 10550010605136.

The previous prime is 10550010604999. The next prime is 10550010605191. The reversal of 10550010605137 is 73150601005501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10318941960721 + 231068644416 = 3212311^2 + 480696^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 210550010605137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15750, while the sum is 34.

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