Base | Representation |
---|---|
bin | 111110111011000011… |
… | …0001000001100111001 |
3 | 110220210010002200010101 |
4 | 1331312012020030321 |
5 | 4203214034212441 |
6 | 142024204115401 |
7 | 12522350063653 |
oct | 1756606101471 |
9 | 426703080111 |
10 | 135125304121 |
11 | 52340790a65 |
12 | 22231235b61 |
13 | c985996672 |
14 | 677c0676d3 |
15 | 37accbc231 |
hex | 1f76188339 |
135125304121 has 2 divisors, whose sum is σ = 135125304122. Its totient is φ = 135125304120.
The previous prime is 135125304107. The next prime is 135125304131. The reversal of 135125304121 is 121403521531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134894598400 + 230705721 = 367280^2 + 15189^2 .
It is a cyclic number.
It is not a de Polignac number, because 135125304121 - 27 = 135125303993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 135125304121.
It is not a weakly prime, because it can be changed into another prime (135125304131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67562652060 + 67562652061.
It is an arithmetic number, because the mean of its divisors is an integer number (67562652061).
Almost surely, 2135125304121 is an apocalyptic number.
It is an amenable number.
135125304121 is a deficient number, since it is larger than the sum of its proper divisors (1).
135125304121 is an equidigital number, since it uses as much as digits as its factorization.
135125304121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 135125304121 its reverse (121403521531), we get a palindrome (256528825652).
The spelling of 135125304121 in words is "one hundred thirty-five billion, one hundred twenty-five million, three hundred four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.272 sec. • engine limits •