Search a number
-
+
136746548581 = 227602407703
BaseRepresentation
bin111111101011010111…
…0101011110101100101
3111001222002202102102111
41333112232223311211
54220024104023311
6142453121041021
712610464325126
oct1772656536545
9431862672374
10136746548581
1152aa2952a15
1222604186171
13cb8382a106
1468934cc04d
1538552b5d21
hex1fd6babd65

136746548581 has 4 divisors (see below), whose sum is σ = 137348956512. Its totient is φ = 136144140652.

The previous prime is 136746548569. The next prime is 136746548623. The reversal of 136746548581 is 185845647631.

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.

It is a cyclic number.

It is not a de Polignac number, because 136746548581 - 27 = 136746548453 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 2136746548581 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 602407930.

The product of its digits is 19353600, while the sum is 58.

The spelling of 136746548581 in words is "one hundred thirty-six billion, seven hundred forty-six million, five hundred forty-eight thousand, five hundred eighty-one".

Divisors: 1 227 602407703 136746548581