Search a number
-
+
136948515555 = 3523396952219
BaseRepresentation
bin111111110001011000…
…1001000001011100011
3111002111011210102000210
41333202301020023203
54220432304444210
6142525133545203
712615466114125
oct1774261101343
9432434712023
10136948515555
1153096959775
122265b945203
13cbb66227b7
1468b2263215
153867dace20
hex1fe2c482e3

136948515555 has 16 divisors (see below), whose sum is σ = 228644478720. Its totient is φ = 69863590368.

The previous prime is 136948515553. The next prime is 136948515559. The reversal of 136948515555 is 555515849631.

It is not a de Polignac number, because 136948515555 - 21 = 136948515553 is a prime.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 198475765 + ... + 198476454.

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

Almost surely, 2136948515555 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 396952250.

The product of its digits is 16200000, while the sum is 57.

The spelling of 136948515555 in words is "one hundred thirty-six billion, nine hundred forty-eight million, five hundred fifteen thousand, five hundred fifty-five".

Divisors: 1 3 5 15 23 69 115 345 396952219 1190856657 1984761095 5954283285 9129901037 27389703111 45649505185 136948515555