Base | Representation |
---|---|
bin | 111111001010101101… |
… | …1110101100101100011 |
3 | 110222010202110022000202 |
4 | 1332111123311211203 |
5 | 4210303134314424 |
6 | 142152305335415 |
7 | 12541363141505 |
oct | 1762533654543 |
9 | 428122408022 |
10 | 135651088739 |
11 | 52590559801 |
12 | 2235933756b |
13 | ca3a8a8b1a |
14 | 67cbc11d75 |
15 | 37de02a2ae |
hex | 1f956f5963 |
135651088739 has 4 divisors (see below), whose sum is σ = 135729820056. Its totient is φ = 135572357424.
The previous prime is 135651088723. The next prime is 135651088777. The reversal of 135651088739 is 937880156531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 937880156531 = 5657 ⋅165791083.
It is a cyclic number.
It is not a de Polignac number, because 135651088739 - 24 = 135651088723 is a prime.
It is a super-2 number, since 2×1356510887392 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135651088799) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39363074 + ... + 39366519.
It is an arithmetic number, because the mean of its divisors is an integer number (33932455014).
Almost surely, 2135651088739 is an apocalyptic number.
135651088739 is a deficient number, since it is larger than the sum of its proper divisors (78731317).
135651088739 is an equidigital number, since it uses as much as digits as its factorization.
135651088739 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78731316.
The product of its (nonzero) digits is 5443200, while the sum is 56.
The spelling of 135651088739 in words is "one hundred thirty-five billion, six hundred fifty-one million, eighty-eight thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •