Search a number
-
+
153104115 = 3559172999
BaseRepresentation
bin10010010000000…
…10111011110011
3101200002111100210
421020002323303
5303143312430
623105315203
73536235453
oct1110027363
9350074323
10153104115
117947242a
1243335b03
1325947a68
1416495d63
15d6942b0
hex9202ef3

153104115 has 16 divisors (see below), whose sum is σ = 249120000. Its totient is φ = 80271072.

The previous prime is 153104101. The next prime is 153104131. The reversal of 153104115 is 511401351.

It is a happy number.

It is not a de Polignac number, because 153104115 - 27 = 153103987 is a prime.

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

It is an unprimeable number.

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 in 15 ways as a sum of consecutive naturals, for example, 85615 + ... + 87384.

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

Almost surely, 2153104115 is an apocalyptic number.

153104115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

The sum of its prime factors is 173066.

The product of its (nonzero) digits is 300, while the sum is 21.

The square root of 153104115 is about 12373.5247605523. The cubic root of 153104115 is about 534.9694162503.

Adding to 153104115 its reverse (511401351), we get a palindrome (664505466).

The spelling of 153104115 in words is "one hundred fifty-three million, one hundred four thousand, one hundred fifteen".

Divisors: 1 3 5 15 59 177 295 885 172999 518997 864995 2594985 10206941 30620823 51034705 153104115