Search a number
-
+
10133625569 is a prime number
BaseRepresentation
bin10010111000000001…
…01101101011100001
3222011020012111221112
421130000231223201
5131223202004234
64353314433105
7506056252604
oct113400555341
928136174845
1010133625569
114330192971
121b69892795
13c565a5262
146c1bc833b
153e49a5ace
hex25c02dae1

10133625569 has 2 divisors, whose sum is σ = 10133625570. Its totient is φ = 10133625568.

The previous prime is 10133625497. The next prime is 10133625583. The reversal of 10133625569 is 96552633101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10021011025 + 112614544 = 100105^2 + 10612^2 .

It is a cyclic number.

It is not a de Polignac number, because 10133625569 - 216 = 10133560033 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 210133625569 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10133625569 in words is "ten billion, one hundred thirty-three million, six hundred twenty-five thousand, five hundred sixty-nine".