Search a number
-
+
153253433 is a prime number
BaseRepresentation
bin10010010001001…
…11011000111001
3101200101002012002
421020213120321
5303213102213
623112430345
73540430004
oct1110473071
9350332162
10153253433
1179564633
12433a83b5
132599aa08
14164d453b
15d6c3658
hex9227639

153253433 has 2 divisors, whose sum is σ = 153253434. Its totient is φ = 153253432.

The previous prime is 153253427. The next prime is 153253447. The reversal of 153253433 is 334352351.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 148181929 + 5071504 = 12173^2 + 2252^2 .

It is a cyclic number.

It is not a de Polignac number, because 153253433 - 224 = 136476217 is a prime.

It is a super-2 number, since 2×1532534332 = 46973229452570978, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2153253433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 16200, while the sum is 29.

The square root of 153253433 is about 12379.5570599275. The cubic root of 153253433 is about 535.1432731254.

The spelling of 153253433 in words is "one hundred fifty-three million, two hundred fifty-three thousand, four hundred thirty-three".