Base | Representation |
---|---|
bin | 11110110101100010011101… |
… | …111110100010101100111011 |
3 | 122210012012022110101121010110 |
4 | 132311202131332202230323 |
5 | 120234001330131201400 |
6 | 1200235114232115403 |
7 | 40365155232314652 |
oct | 3665423576425473 |
9 | 583165273347113 |
10 | 135620537756475 |
11 | 3a23838aa41742 |
12 | 13264203835b63 |
13 | 5a89c671c5c75 |
14 | 256c0d7694199 |
15 | 10a2c04bc8e50 |
hex | 7b589dfa2b3b |
135620537756475 has 24 divisors (see below), whose sum is σ = 224716603419760. Its totient is φ = 72172680030720.
The previous prime is 135620537756411. The next prime is 135620537756479. The reversal of 135620537756475 is 574657735026531.
It is not a de Polignac number, because 135620537756475 - 26 = 135620537756411 is a prime.
It is a super-2 number, since 2×1356205377564752 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (135620537756479) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1978383490 + ... + 1978452039.
Almost surely, 2135620537756475 is an apocalyptic number.
135620537756475 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
135620537756475 is a deficient number, since it is larger than the sum of its proper divisors (89096065663285).
135620537756475 is a wasteful number, since it uses less digits than its factorization.
135620537756475 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3956835999 (or 3956835994 counting only the distinct ones).
The product of its (nonzero) digits is 555660000, while the sum is 66.
The spelling of 135620537756475 in words is "one hundred thirty-five trillion, six hundred twenty billion, five hundred thirty-seven million, seven hundred fifty-six thousand, four hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •