Base | Representation |
---|---|
bin | 11110110111010111111001… |
… | …001001101011110100101110 |
3 | 122210122020202110010011000000 |
4 | 132313113321021223310232 |
5 | 120243033040043040122 |
6 | 1200413045331245130 |
7 | 40410240553136460 |
oct | 3667277111536456 |
9 | 583566673104000 |
10 | 135746621455662 |
11 | 3a2869009a5028 |
12 | 13284730a497a6 |
13 | 5a98b0b903129 |
14 | 2574258996130 |
15 | 10a6133cec0ac |
hex | 7b75f926bd2e |
135746621455662 has 56 divisors (see below), whose sum is σ = 348903132891696. Its totient is φ = 38784748984416.
The previous prime is 135746621455661. The next prime is 135746621455721. The reversal of 135746621455662 is 266554126647531.
It is a happy number.
135746621455662 is a `hidden beast` number, since 1 + 3 + 5 + 7 + 4 + 6 + 6 + 2 + 14 + 556 + 62 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a self number, because there is not a number n which added to its sum of digits gives 135746621455662.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135746621455661) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 6650323983 + ... + 6650344394.
Almost surely, 2135746621455662 is an apocalyptic number.
135746621455662 is an abundant number, since it is smaller than the sum of its proper divisors (213156511436034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135746621455662 is an equidigital number, since it uses as much as digits as its factorization.
135746621455662 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13300668404 (or 13300668389 counting only the distinct ones).
The product of its digits is 217728000, while the sum is 63.
The spelling of 135746621455662 in words is "one hundred thirty-five trillion, seven hundred forty-six billion, six hundred twenty-one million, four hundred fifty-five thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •