Search a number
-
+
136915083355 = 5257106548703
BaseRepresentation
bin111111110000011000…
…1100110000001011011
3111002101211212212200011
41333200301212001123
54220400230131410
6142521541222351
712614612002141
oct1774061460133
9432354785604
10136915083355
1153079aa4656
12226507019b7
13cbac71852b
1468aba3d591
153864ea718a
hex1fe0c6605b

136915083355 has 8 divisors (see below), whose sum is σ = 164937393792. Its totient is φ = 109105870848.

The previous prime is 136915083337. The next prime is 136915083367. The reversal of 136915083355 is 553380519631.

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

It is a cyclic number.

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

It is a Duffinian number.

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

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 53273067 + ... + 53275636.

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

Almost surely, 2136915083355 is an apocalyptic number.

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

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

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

The sum of its prime factors is 106548965.

The product of its (nonzero) digits is 1458000, while the sum is 49.

The spelling of 136915083355 in words is "one hundred thirty-six billion, nine hundred fifteen million, eighty-three thousand, three hundred fifty-five".

Divisors: 1 5 257 1285 106548703 532743515 27383016671 136915083355