Base | Representation |
---|---|
bin | 111110001000000101… |
… | …0110110010000111101 |
3 | 110202100221100200220202 |
4 | 1330100022312100331 |
5 | 4141213301442331 |
6 | 141142400053245 |
7 | 12432104021111 |
oct | 1742012662075 |
9 | 422327320822 |
10 | 133415265341 |
11 | 51643491576 |
12 | 21a34604225 |
13 | c7726139b7 |
14 | 6658ccb741 |
15 | 370cad3ecb |
hex | 1f102b643d |
133415265341 has 2 divisors, whose sum is σ = 133415265342. Its totient is φ = 133415265340.
The previous prime is 133415265293. The next prime is 133415265343. The reversal of 133415265341 is 143562514331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118174375225 + 15240890116 = 343765^2 + 123454^2 .
It is a cyclic number.
It is not a de Polignac number, because 133415265341 - 234 = 116235396157 is a prime.
Together with 133415265343, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 133415265295 and 133415265304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133415265343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66707632670 + 66707632671.
It is an arithmetic number, because the mean of its divisors is an integer number (66707632671).
Almost surely, 2133415265341 is an apocalyptic number.
It is an amenable number.
133415265341 is a deficient number, since it is larger than the sum of its proper divisors (1).
133415265341 is an equidigital number, since it uses as much as digits as its factorization.
133415265341 is an evil number, because the sum of its binary digits is even.
The product of its digits is 129600, while the sum is 38.
Adding to 133415265341 its reverse (143562514331), we get a palindrome (276977779672).
The spelling of 133415265341 in words is "one hundred thirty-three billion, four hundred fifteen million, two hundred sixty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •