Base | Representation |
---|---|
bin | 11110110011111100101111… |
… | …100000111100011010011111 |
3 | 122202210202101012200222110211 |
4 | 132303330233200330122133 |
5 | 120230204130420240221 |
6 | 1200113011521113251 |
7 | 40354240411404061 |
oct | 3663745740743237 |
9 | 582722335628424 |
10 | 135511310321311 |
11 | 3a1a60299a3a71 |
12 | 13246bbb788827 |
13 | 5a7c87aa94522 |
14 | 2566ad4d37731 |
15 | 109ee608396e1 |
hex | 7b3f2f83c69f |
135511310321311 has 4 divisors (see below), whose sum is σ = 135511527283632. Its totient is φ = 135511093358992.
The previous prime is 135511310321297. The next prime is 135511310321323. The reversal of 135511310321311 is 113123013115531.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 135511310321311 - 219 = 135511309797023 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 (135511310321381) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 107541571 + ... + 108794356.
It is an arithmetic number, because the mean of its divisors is an integer number (33877881820908).
Almost surely, 2135511310321311 is an apocalyptic number.
135511310321311 is a deficient number, since it is larger than the sum of its proper divisors (216962321).
135511310321311 is an equidigital number, since it uses as much as digits as its factorization.
135511310321311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 216962320.
The product of its (nonzero) digits is 4050, while the sum is 31.
Adding to 135511310321311 its reverse (113123013115531), we get a palindrome (248634323436842).
The spelling of 135511310321311 in words is "one hundred thirty-five trillion, five hundred eleven billion, three hundred ten million, three hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •