Search a number
-
+
153705031 is a prime number
BaseRepresentation
bin10010010100101…
…01101001000111
3101201020000122221
421022111221013
5303322030111
623130233211
73544320424
oct1112255107
9351200587
10153705031
1179842957
1243585807
1325ac842c
14165b0d4b
15d762371
hex9295a47

153705031 has 2 divisors, whose sum is σ = 153705032. Its totient is φ = 153705030.

The previous prime is 153705011. The next prime is 153705049. The reversal of 153705031 is 130507351.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 153705031 - 29 = 153704519 is a prime.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (153705001) 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, 76852515 + 76852516.

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

Almost surely, 2153705031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1575, while the sum is 25.

The square root of 153705031 is about 12397.7833099309. The cubic root of 153705031 is about 535.6684003298.

The spelling of 153705031 in words is "one hundred fifty-three million, seven hundred five thousand, thirty-one".