Base | Representation |
---|---|
bin | 111111000000010110… |
… | …0110000110100100011 |
3 | 110221020111211221001122 |
4 | 1332000230300310203 |
5 | 4204100110013011 |
6 | 142054001122455 |
7 | 12526640154614 |
oct | 1760054606443 |
9 | 427214757048 |
10 | 135303204131 |
11 | 52422149967 |
12 | 2228092942b |
13 | c9b37b3744 |
14 | 6797935c0b |
15 | 37bd70d3db |
hex | 1f80b30d23 |
135303204131 has 2 divisors, whose sum is σ = 135303204132. Its totient is φ = 135303204130.
The previous prime is 135303204053. The next prime is 135303204133. The reversal of 135303204131 is 131402303531.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 135303204131 - 230 = 134229462307 is a prime.
It is a super-2 number, since 2×1353032041312 (a number of 23 digits) contains 22 as substring.
Together with 135303204133, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 135303204131.
It is not a weakly prime, because it can be changed into another prime (135303204133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67651602065 + 67651602066.
It is an arithmetic number, because the mean of its divisors is an integer number (67651602066).
Almost surely, 2135303204131 is an apocalyptic number.
135303204131 is a deficient number, since it is larger than the sum of its proper divisors (1).
135303204131 is an equidigital number, since it uses as much as digits as its factorization.
135303204131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 135303204131 its reverse (131402303531), we get a palindrome (266705507662).
The spelling of 135303204131 in words is "one hundred thirty-five billion, three hundred three million, two hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •