Search a number
-
+
153905313 = 351301771
BaseRepresentation
bin10010010110001…
…10100010100001
3101201121012101210
421023012202201
5303344432223
623134420333
73546113352
oct1113064241
9351535353
10153905313
117996a381
12436616a9
1325b68643
1416623d29
15d7a1893
hex92c68a1

153905313 has 4 divisors (see below), whose sum is σ = 205207088. Its totient is φ = 102603540.

The previous prime is 153905309. The next prime is 153905327. The reversal of 153905313 is 313509351.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 313509351 = 3104503117.

It is not a de Polignac number, because 153905313 - 22 = 153905309 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (153905333) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25650883 + ... + 25650888.

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

Almost surely, 2153905313 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 51301774.

The product of its (nonzero) digits is 6075, while the sum is 30.

The square root of 153905313 is about 12405.8580114396. The cubic root of 153905313 is about 535.9009630360.

The spelling of 153905313 in words is "one hundred fifty-three million, nine hundred five thousand, three hundred thirteen".

Divisors: 1 3 51301771 153905313