Base | Representation |
---|---|
bin | 111111001101101111… |
… | …0100001001100000001 |
3 | 110222101211012020021111 |
4 | 1332123132201030001 |
5 | 4211010112024123 |
6 | 142210330123321 |
7 | 12544033553635 |
oct | 1763336411401 |
9 | 428354166244 |
10 | 135752454913 |
11 | 526327a36a9 |
12 | 22387280541 |
13 | ca558aa3ca |
14 | 67db47adc5 |
15 | 37e7d9e90d |
hex | 1f9b7a1301 |
135752454913 has 4 divisors (see below), whose sum is σ = 135766195200. Its totient is φ = 135738714628.
The previous prime is 135752454889. The next prime is 135752454923. The reversal of 135752454913 is 319454257531.
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, and also an emirpimes, since its reverse is a distinct semiprime: 319454257531 = 67 ⋅4767973993.
It is a cyclic number.
It is not a de Polignac number, because 135752454913 - 213 = 135752446721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135752454923) 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 3 ways as a sum of consecutive naturals, for example, 6855313 + ... + 6875086.
It is an arithmetic number, because the mean of its divisors is an integer number (33941548800).
Almost surely, 2135752454913 is an apocalyptic number.
It is an amenable number.
135752454913 is a deficient number, since it is larger than the sum of its proper divisors (13740287).
135752454913 is an equidigital number, since it uses as much as digits as its factorization.
135752454913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13740286.
The product of its digits is 2268000, while the sum is 49.
The spelling of 135752454913 in words is "one hundred thirty-five billion, seven hundred fifty-two million, four hundred fifty-four thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •