Base | Representation |
---|---|
bin | 111111000001110000… |
… | …0110110111100011011 |
3 | 110221100210200111101012 |
4 | 1332003200312330123 |
5 | 4204144201241011 |
6 | 142102405044135 |
7 | 12531052355201 |
oct | 1760340667433 |
9 | 427323614335 |
10 | 135350415131 |
11 | 52446865218 |
12 | 222946b664b |
13 | c9c0503549 |
14 | 679dd05071 |
15 | 37c2936a8b |
hex | 1f83836f1b |
135350415131 has 2 divisors, whose sum is σ = 135350415132. Its totient is φ = 135350415130.
The previous prime is 135350415127. The next prime is 135350415133. The reversal of 135350415131 is 131514053531.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 135350415131 - 22 = 135350415127 is a prime.
It is a super-2 number, since 2×1353504151312 (a number of 23 digits) contains 22 as substring.
Together with 135350415133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (135350415133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67675207565 + 67675207566.
It is an arithmetic number, because the mean of its divisors is an integer number (67675207566).
Almost surely, 2135350415131 is an apocalyptic number.
135350415131 is a deficient number, since it is larger than the sum of its proper divisors (1).
135350415131 is an equidigital number, since it uses as much as digits as its factorization.
135350415131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 32.
Adding to 135350415131 its reverse (131514053531), we get a palindrome (266864468662).
The spelling of 135350415131 in words is "one hundred thirty-five billion, three hundred fifty million, four hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •