Base | Representation |
---|---|
bin | 11110110010111111001011… |
… | …110001100010101010101111 |
3 | 122202120102202201212202212102 |
4 | 132302333023301202222233 |
5 | 120223113243341110023 |
6 | 1200022401022125315 |
7 | 40346410425605324 |
oct | 3662771361425257 |
9 | 582512681782772 |
10 | 135445212441263 |
11 | 3a17aaa041241a |
12 | 1323623372083b |
13 | 5a76575bba9ba |
14 | 2563824676b4b |
15 | 109d392ab7628 |
hex | 7b2fcbc62aaf |
135445212441263 has 2 divisors, whose sum is σ = 135445212441264. Its totient is φ = 135445212441262.
The previous prime is 135445212441193. The next prime is 135445212441271. The reversal of 135445212441263 is 362144212544531.
It is a strong prime.
It is an emirp because it is prime and its reverse (362144212544531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 135445212441263 - 218 = 135445212179119 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135445212401263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67722606220631 + 67722606220632.
It is an arithmetic number, because the mean of its divisors is an integer number (67722606220632).
Almost surely, 2135445212441263 is an apocalyptic number.
135445212441263 is a deficient number, since it is larger than the sum of its proper divisors (1).
135445212441263 is an equidigital number, since it uses as much as digits as its factorization.
135445212441263 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2764800, while the sum is 47.
Adding to 135445212441263 its reverse (362144212544531), we get a palindrome (497589424985794).
The spelling of 135445212441263 in words is "one hundred thirty-five trillion, four hundred forty-five billion, two hundred twelve million, four hundred forty-one thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •