Search a number
-
+
153673031 is a prime number
BaseRepresentation
bin10010010100011…
…01110101000111
3101201011101202202
421022031311013
5303320014111
623125425115
73544125221
oct1112156507
9351141682
10153673031
1179820906
124356b19b
1325ab69b5
14165a3411
15d757b3b
hex928dd47

153673031 has 2 divisors, whose sum is σ = 153673032. Its totient is φ = 153673030.

The previous prime is 153673027. The next prime is 153673049. The reversal of 153673031 is 130376351.

It is a happy number.

153673031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 153673031 - 22 = 153673027 is a prime.

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

It is a Sophie Germain prime.

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 2153673031 is an apocalyptic number.

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

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

153673031 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 5670, while the sum is 29.

The square root of 153673031 is about 12396.4926894666. The cubic root of 153673031 is about 535.6312239745.

The spelling of 153673031 in words is "one hundred fifty-three million, six hundred seventy-three thousand, thirty-one".