Search a number
-
+
201251256533 is a prime number
BaseRepresentation
bin1011101101101110000…
…0100111100011010101
3201020110112202002202222
42323123200213203111
511244130310202113
6232241544512125
720353123312145
oct2733340474325
9636415662688
10201251256533
11783940a6808
123300677b645
1315c9361b962
149a52354925
15537d236e08
hex2edb8278d5

201251256533 has 2 divisors, whose sum is σ = 201251256534. Its totient is φ = 201251256532.

The previous prime is 201251256511. The next prime is 201251256541. The reversal of 201251256533 is 335652152102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 166641119089 + 34610137444 = 408217^2 + 186038^2 .

It is a cyclic number.

It is not a de Polignac number, because 201251256533 - 216 = 201251190997 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 201251256493 and 201251256502.

It is a congruent number.

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

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

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

Almost surely, 2201251256533 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54000, while the sum is 35.

The spelling of 201251256533 in words is "two hundred one billion, two hundred fifty-one million, two hundred fifty-six thousand, five hundred thirty-three".