Base | Representation |
---|---|
bin | 11110110001110110101111… |
… | …011010010000000101011101 |
3 | 122202021222222202011012012111 |
4 | 132301312233122100011131 |
5 | 120220324442323144321 |
6 | 1155522534301434021 |
7 | 40340655015624664 |
oct | 3661665732200535 |
9 | 582258882135174 |
10 | 135367427162461 |
11 | 3a15000468013a |
12 | 1322314556b911 |
13 | 5a6c12a870000 |
14 | 255db65acbddb |
15 | 109b33dc725e1 |
hex | 7b1daf69015d |
135367427162461 has 10 divisors (see below), whose sum is σ = 146647651157782. Its totient is φ = 124954548123600.
The previous prime is 135367427162413. The next prime is 135367427162501. The reversal of 135367427162461 is 164261724763531.
It can be written as a sum of positive squares in 5 ways, for example, as 123025941990436 + 12341485172025 = 11091706^2 + 3513045^2 .
It is not a de Polignac number, because 135367427162461 - 213 = 135367427154269 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135367427162396 and 135367427162405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135367427163461) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2369766390 + ... + 2369823511.
Almost surely, 2135367427162461 is an apocalyptic number.
It is an amenable number.
135367427162461 is a deficient number, since it is larger than the sum of its proper divisors (11280223995321).
135367427162461 is an frugal number, since it uses more digits than its factorization.
135367427162461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4739589953 (or 4739589914 counting only the distinct ones).
The product of its digits is 30481920, while the sum is 58.
The spelling of 135367427162461 in words is "one hundred thirty-five trillion, three hundred sixty-seven billion, four hundred twenty-seven million, one hundred sixty-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •