Base | Representation |
---|---|
bin | 111110111011101001… |
… | …0110011011011010001 |
3 | 110220211111220212010112 |
4 | 1331313102303123101 |
5 | 4203234210412423 |
6 | 142030203011105 |
7 | 12523012660346 |
oct | 1756722633321 |
9 | 426744825115 |
10 | 135145404113 |
11 | 5235106a425 |
12 | 22237b09a95 |
13 | c989bb3455 |
14 | 67809ba7cd |
15 | 37ae93ca78 |
hex | 1f774b36d1 |
135145404113 has 2 divisors, whose sum is σ = 135145404114. Its totient is φ = 135145404112.
The previous prime is 135145404103. The next prime is 135145404259. The reversal of 135145404113 is 311404541531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130893451264 + 4251952849 = 361792^2 + 65207^2 .
It is a cyclic number.
It is not a de Polignac number, because 135145404113 - 210 = 135145403089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 135145404113.
It is not a weakly prime, because it can be changed into another prime (135145404103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67572702056 + 67572702057.
It is an arithmetic number, because the mean of its divisors is an integer number (67572702057).
Almost surely, 2135145404113 is an apocalyptic number.
It is an amenable number.
135145404113 is a deficient number, since it is larger than the sum of its proper divisors (1).
135145404113 is an equidigital number, since it uses as much as digits as its factorization.
135145404113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 135145404113 its reverse (311404541531), we get a palindrome (446549945644).
The spelling of 135145404113 in words is "one hundred thirty-five billion, one hundred forty-five million, four hundred four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •