Base | Representation |
---|---|
bin | 11110101110001000010110… |
… | …010010110101100010100101 |
3 | 122201101112021121210221121112 |
4 | 132232020112102311202211 |
5 | 120202131230014443323 |
6 | 1155205202354554405 |
7 | 40313323546264463 |
oct | 3656102622654245 |
9 | 581345247727545 |
10 | 135111455234213 |
11 | 3a0614a01498a7 |
12 | 131a1608b98a05 |
13 | 5a50c56493783 |
14 | 25516020d7833 |
15 | 109485ba18178 |
hex | 7ae2164b58a5 |
135111455234213 has 8 divisors (see below), whose sum is σ = 135337047574848. Its totient is φ = 134885910924864.
The previous prime is 135111455234177. The next prime is 135111455234219. The reversal of 135111455234213 is 312432554111531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135111455234213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135111455234219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6374945 + ... + 17631302.
It is an arithmetic number, because the mean of its divisors is an integer number (16917130946856).
Almost surely, 2135111455234213 is an apocalyptic number.
It is an amenable number.
135111455234213 is a deficient number, since it is larger than the sum of its proper divisors (225592340635).
135111455234213 is an equidigital number, since it uses as much as digits as its factorization.
135111455234213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24015643.
The product of its digits is 216000, while the sum is 41.
The spelling of 135111455234213 in words is "one hundred thirty-five trillion, one hundred eleven billion, four hundred fifty-five million, two hundred thirty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •