Base | Representation |
---|---|
bin | 111111000110100011… |
… | …0010111101000111001 |
3 | 110221210000022102011211 |
4 | 1332031012113220321 |
5 | 4210011334241241 |
6 | 142130352123121 |
7 | 12535044364066 |
oct | 1761506275071 |
9 | 427700272154 |
10 | 135511243321 |
11 | 52519622883 |
12 | 2231a5364a1 |
13 | ca17923c5c |
14 | 67b740bc6d |
15 | 37d1b04781 |
hex | 1f8d197a39 |
135511243321 has 4 divisors (see below), whose sum is σ = 138394461312. Its totient is φ = 132628025332.
The previous prime is 135511243303. The next prime is 135511243337. The reversal of 135511243321 is 123342115531.
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, and also an emirpimes, since its reverse is a distinct semiprime: 123342115531 = 53 ⋅2327209727.
It is a cyclic number.
It is not a de Polignac number, because 135511243321 - 215 = 135511210553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135511243121) 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, 1441608925 + ... + 1441609018.
It is an arithmetic number, because the mean of its divisors is an integer number (34598615328).
Almost surely, 2135511243321 is an apocalyptic number.
It is an amenable number.
135511243321 is a deficient number, since it is larger than the sum of its proper divisors (2883217991).
135511243321 is an equidigital number, since it uses as much as digits as its factorization.
135511243321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2883217990.
The product of its digits is 10800, while the sum is 31.
Adding to 135511243321 its reverse (123342115531), we get a palindrome (258853358852).
The spelling of 135511243321 in words is "one hundred thirty-five billion, five hundred eleven million, two hundred forty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •