Base | Representation |
---|---|
bin | 111111000110100001… |
… | …1101100011110010111 |
3 | 110221202221222210110112 |
4 | 1332031003230132113 |
5 | 4210011144322411 |
6 | 142130325113235 |
7 | 12535035414101 |
oct | 1761503543627 |
9 | 427687883415 |
10 | 135510542231 |
11 | 52519194069 |
12 | 2231a25881b |
13 | ca17739acc |
14 | 67b72a8571 |
15 | 37d1a16b8b |
hex | 1f8d0ec797 |
135510542231 has 4 divisors (see below), whose sum is σ = 135590585592. Its totient is φ = 135430498872.
The previous prime is 135510542213. The next prime is 135510542243. The reversal of 135510542231 is 132245015531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 132245015531 = 4091 ⋅32325841.
It is a cyclic number.
It is not a de Polignac number, because 135510542231 - 214 = 135510525847 is a prime.
It is a super-2 number, since 2×1355105422312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135510547231) 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, 40019141 + ... + 40022526.
It is an arithmetic number, because the mean of its divisors is an integer number (33897646398).
Almost surely, 2135510542231 is an apocalyptic number.
135510542231 is a deficient number, since it is larger than the sum of its proper divisors (80043361).
135510542231 is an equidigital number, since it uses as much as digits as its factorization.
135510542231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80043360.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 135510542231 its reverse (132245015531), we get a palindrome (267755557762).
The spelling of 135510542231 in words is "one hundred thirty-five billion, five hundred ten million, five hundred forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •