Search a number
-
+
153970931 is a prime number
BaseRepresentation
bin10010010110101…
…10100011110011
3101201201112102002
421023112203303
5303404032211
623140044215
73546505562
oct1113264363
9351645362
10153970931
1179a04704
124369366b
1325b8c47a
141663dbd9
15d7b603b
hex92d68f3

153970931 has 2 divisors, whose sum is σ = 153970932. Its totient is φ = 153970930.

The previous prime is 153970907. The next prime is 153970933. The reversal of 153970931 is 139079351.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-153970931 is a prime.

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

It is a Sophie Germain prime.

Together with 153970933, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 2153970931 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 25515, while the sum is 38.

The square root of 153970931 is about 12408.5023673286. The cubic root of 153970931 is about 535.9771132186.

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