Base | Representation |
---|---|
bin | 11110110101010010110000… |
… | …001100001011010010110001 |
3 | 122210010120202110102002010012 |
4 | 132311102300030023102301 |
5 | 120233212300320420223 |
6 | 1200223244001144305 |
7 | 40364020123144001 |
oct | 3665226014132261 |
9 | 583116673362105 |
10 | 135603663451313 |
11 | 3a2312109244a2 |
12 | 13260a9462b095 |
13 | 5a884a8271905 |
14 | 256b376574001 |
15 | 10a256857ec78 |
hex | 7b54b030b4b1 |
135603663451313 has 8 divisors (see below), whose sum is σ = 135632997026208. Its totient is φ = 135574332189984.
The previous prime is 135603663451301. The next prime is 135603663451351. The reversal of 135603663451313 is 313154366306531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 135603663451313 - 214 = 135603663434929 is a prime.
It is a super-2 number, since 2×1356036634513132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (135603663451013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119336645 + ... + 120467597.
It is an arithmetic number, because the mean of its divisors is an integer number (16954124628276).
Almost surely, 2135603663451313 is an apocalyptic number.
It is an amenable number.
135603663451313 is a deficient number, since it is larger than the sum of its proper divisors (29333574895).
135603663451313 is a wasteful number, since it uses less digits than its factorization.
135603663451313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1156783.
The product of its (nonzero) digits is 5248800, while the sum is 50.
The spelling of 135603663451313 in words is "one hundred thirty-five trillion, six hundred three billion, six hundred sixty-three million, four hundred fifty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •