Base | Representation |
---|---|
bin | 11110110100011011101100… |
… | …111111101000111111110101 |
3 | 122202220221012000121111222010 |
4 | 132310123230333220333311 |
5 | 120231230221313030031 |
6 | 1200140150345154433 |
7 | 40356525256320531 |
oct | 3664335477507765 |
9 | 582827160544863 |
10 | 135544554033141 |
11 | 3a209139126780 |
12 | 13251538a8ba19 |
13 | 5a82a48191326 |
14 | 256856a0a8bc1 |
15 | 10a0c590e8246 |
hex | 7b46ecfe8ff5 |
135544554033141 has 32 divisors (see below), whose sum is σ = 215487081271296. Its totient is φ = 74821903200000.
The previous prime is 135544554033131. The next prime is 135544554033191. The reversal of 135544554033141 is 141330455445531.
It is not a de Polignac number, because 135544554033141 - 210 = 135544554032117 is a prime.
It is a super-2 number, since 2×1355445540331412 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135544554033121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3896956735 + ... + 3896991516.
It is an arithmetic number, because the mean of its divisors is an integer number (6733971289728).
Almost surely, 2135544554033141 is an apocalyptic number.
135544554033141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
135544554033141 is a deficient number, since it is larger than the sum of its proper divisors (79942527238155).
135544554033141 is a wasteful number, since it uses less digits than its factorization.
135544554033141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7793948313.
The product of its (nonzero) digits is 4320000, while the sum is 48.
The spelling of 135544554033141 in words is "one hundred thirty-five trillion, five hundred forty-four billion, five hundred fifty-four million, thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •