Base | Representation |
---|---|
bin | 111111000111110011… |
… | …0111001000000100001 |
3 | 110221212221111021200222 |
4 | 1332033212321000201 |
5 | 4210103122314131 |
6 | 142134454052425 |
7 | 12536065143353 |
oct | 1761746710041 |
9 | 427787437628 |
10 | 135553323041 |
11 | 52540353a04 |
12 | 2233064a115 |
13 | ca235682b6 |
14 | 67bcc430d3 |
15 | 37d566787b |
hex | 1f8f9b9021 |
135553323041 has 2 divisors, whose sum is σ = 135553323042. Its totient is φ = 135553323040.
The previous prime is 135553322963. The next prime is 135553323053. The reversal of 135553323041 is 140323355531.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 133356432400 + 2196890641 = 365180^2 + 46871^2 .
It is a cyclic number.
It is not a de Polignac number, because 135553323041 - 226 = 135486214177 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135553322992 and 135553323010.
It is not a weakly prime, because it can be changed into another prime (135553313041) 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, 67776661520 + 67776661521.
It is an arithmetic number, because the mean of its divisors is an integer number (67776661521).
Almost surely, 2135553323041 is an apocalyptic number.
It is an amenable number.
135553323041 is a deficient number, since it is larger than the sum of its proper divisors (1).
135553323041 is an equidigital number, since it uses as much as digits as its factorization.
135553323041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81000, while the sum is 35.
Adding to 135553323041 its reverse (140323355531), we get a palindrome (275876678572).
The spelling of 135553323041 in words is "one hundred thirty-five billion, five hundred fifty-three million, three hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •