Base | Representation |
---|---|
bin | 111111000110000000… |
… | …0010000011011011101 |
3 | 110221201201201122002110 |
4 | 1332030000100123131 |
5 | 4204442133114314 |
6 | 142124454144233 |
7 | 12534432224160 |
oct | 1761400203335 |
9 | 427651648073 |
10 | 135492863709 |
11 | 5250a209a15 |
12 | 22314352079 |
13 | ca13b8a248 |
14 | 67b4bc5ad7 |
15 | 37d01c3a59 |
hex | 1f8c0106dd |
135492863709 has 16 divisors (see below), whose sum is σ = 213125488640. Its totient is φ = 74926928880.
The previous prime is 135492863687. The next prime is 135492863717. The reversal of 135492863709 is 907368294531.
It is not a de Polignac number, because 135492863709 - 28 = 135492863453 is a prime.
It is a super-4 number, since 4×1354928637094 (a number of 46 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135492863719) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 104064529 + ... + 104065830.
It is an arithmetic number, because the mean of its divisors is an integer number (13320343040).
It is a 1-persistent number, because it is pandigital, but 2⋅135492863709 = 270985727418 is not.
Almost surely, 2135492863709 is an apocalyptic number.
It is an amenable number.
135492863709 is a deficient number, since it is larger than the sum of its proper divisors (77632624931).
135492863709 is a wasteful number, since it uses less digits than its factorization.
135492863709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208130400.
The product of its (nonzero) digits is 9797760, while the sum is 57.
The spelling of 135492863709 in words is "one hundred thirty-five billion, four hundred ninety-two million, eight hundred sixty-three thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •