Base | Representation |
---|---|
bin | 111111000011111011… |
… | …1100010100111100101 |
3 | 110221112220011001220001 |
4 | 1332013313202213211 |
5 | 4204321402020203 |
6 | 142113534541301 |
7 | 12532630334254 |
oct | 1760767424745 |
9 | 427486131801 |
10 | 135423470053 |
11 | 52484022493 |
12 | 222b5067831 |
13 | ca026a1701 |
14 | 67a98c079b |
15 | 37c906791d |
hex | 1f87de29e5 |
135423470053 has 2 divisors, whose sum is σ = 135423470054. Its totient is φ = 135423470052.
The previous prime is 135423470029. The next prime is 135423470173. The reversal of 135423470053 is 350074324531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105818138209 + 29605331844 = 325297^2 + 172062^2 .
It is a cyclic number.
It is not a de Polignac number, because 135423470053 - 225 = 135389915621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135423469994 and 135423470021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135423470003) 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, 67711735026 + 67711735027.
It is an arithmetic number, because the mean of its divisors is an integer number (67711735027).
Almost surely, 2135423470053 is an apocalyptic number.
It is an amenable number.
135423470053 is a deficient number, since it is larger than the sum of its proper divisors (1).
135423470053 is an equidigital number, since it uses as much as digits as its factorization.
135423470053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200, while the sum is 37.
Adding to 135423470053 its reverse (350074324531), we get a palindrome (485497794584).
The spelling of 135423470053 in words is "one hundred thirty-five billion, four hundred twenty-three million, four hundred seventy thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •