Base | Representation |
---|---|
bin | 111111010011001111… |
… | …1111010110101000001 |
3 | 110222212201010222002101 |
4 | 1332212133322311001 |
5 | 4211344431341312 |
6 | 142240533350401 |
7 | 12551440410136 |
oct | 1764637726501 |
9 | 428781128071 |
10 | 135937371457 |
11 | 52718114198 |
12 | 22419198401 |
13 | ca84cb3094 |
14 | 6817c5458d |
15 | 3809229a57 |
hex | 1fa67fad41 |
135937371457 has 2 divisors, whose sum is σ = 135937371458. Its totient is φ = 135937371456.
The previous prime is 135937371391. The next prime is 135937371491. The reversal of 135937371457 is 754173739531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126064763136 + 9872608321 = 355056^2 + 99361^2 .
It is an emirp because it is prime and its reverse (754173739531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 135937371457 - 227 = 135803153729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135937371398 and 135937371407.
It is not a weakly prime, because it can be changed into another prime (135937371257) 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, 67968685728 + 67968685729.
It is an arithmetic number, because the mean of its divisors is an integer number (67968685729).
Almost surely, 2135937371457 is an apocalyptic number.
It is an amenable number.
135937371457 is a deficient number, since it is larger than the sum of its proper divisors (1).
135937371457 is an equidigital number, since it uses as much as digits as its factorization.
135937371457 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8334900, while the sum is 55.
The spelling of 135937371457 in words is "one hundred thirty-five billion, nine hundred thirty-seven million, three hundred seventy-one thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •