Search a number
-
+
153660310053 = 3471089789433
BaseRepresentation
bin1000111100011011011…
…1100100001000100101
3112200121211222112022120
42033012313210020211
510004144014410203
6154331321420153
714046563041065
oct2170667441045
9480554875276
10153660310053
115a19226a288
122594463a659
131164a9b76b3
14761995d3a5
153ee5105b53
hex23c6de4225

153660310053 has 8 divisors (see below), whose sum is σ = 209239571328. Its totient is φ = 100260627744.

The previous prime is 153660310051. The next prime is 153660310093. The reversal of 153660310053 is 350013066351.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 153660310053 - 21 = 153660310051 is a prime.

It is a super-2 number, since 2×1536603100532 (a number of 23 digits) contains 22 as substring.

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

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 544894576 + ... + 544894857.

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

Almost surely, 2153660310053 is an apocalyptic number.

It is an amenable number.

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

153660310053 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1089789483.

The product of its (nonzero) digits is 24300, while the sum is 33.

The spelling of 153660310053 in words is "one hundred fifty-three billion, six hundred sixty million, three hundred ten thousand, fifty-three".

Divisors: 1 3 47 141 1089789433 3269368299 51220103351 153660310053