Base | Representation |
---|---|
bin | 111110111000111010… |
… | …0101110010010000001 |
3 | 110220121010020101100010 |
4 | 1331301310232102001 |
5 | 4203042212221031 |
6 | 142013124015133 |
7 | 12520516636134 |
oct | 1756164562201 |
9 | 426533211303 |
10 | 135053632641 |
11 | 52304289134 |
12 | 222112314a9 |
13 | c973b910c5 |
14 | 677272c21b |
15 | 37a6861246 |
hex | 1f71d2e481 |
135053632641 has 4 divisors (see below), whose sum is σ = 180071510192. Its totient is φ = 90035755092.
The previous prime is 135053632619. The next prime is 135053632673. The reversal of 135053632641 is 146236350531.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a de Polignac number, because none of the positive numbers 2k-135053632641 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 135053632641.
It is not an unprimeable number, because it can be changed into a prime (135053632741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22508938771 + ... + 22508938776.
It is an arithmetic number, because the mean of its divisors is an integer number (45017877548).
Almost surely, 2135053632641 is an apocalyptic number.
It is an amenable number.
135053632641 is a deficient number, since it is larger than the sum of its proper divisors (45017877551).
135053632641 is an equidigital number, since it uses as much as digits as its factorization.
135053632641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45017877550.
The product of its (nonzero) digits is 194400, while the sum is 39.
The spelling of 135053632641 in words is "one hundred thirty-five billion, fifty-three million, six hundred thirty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •