Base | Representation |
---|---|
bin | 111110001011001111… |
… | …0001100110001000101 |
3 | 110202122022022122201022 |
4 | 1330112132030301011 |
5 | 4141422334022131 |
6 | 141201054240525 |
7 | 12434526533654 |
oct | 1742636146105 |
9 | 422568278638 |
10 | 133521001541 |
11 | 51698140764 |
12 | 21a63ab6145 |
13 | c78b4b53b5 |
14 | 6668d7319b |
15 | 371701d37b |
hex | 1f1678cc45 |
133521001541 has 2 divisors, whose sum is σ = 133521001542. Its totient is φ = 133521001540.
The previous prime is 133521001501. The next prime is 133521001583. The reversal of 133521001541 is 145100125331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130685865025 + 2835136516 = 361505^2 + 53246^2 .
It is a cyclic number.
It is not a de Polignac number, because 133521001541 - 26 = 133521001477 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133521001541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133521001501) 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, 66760500770 + 66760500771.
It is an arithmetic number, because the mean of its divisors is an integer number (66760500771).
Almost surely, 2133521001541 is an apocalyptic number.
It is an amenable number.
133521001541 is a deficient number, since it is larger than the sum of its proper divisors (1).
133521001541 is an equidigital number, since it uses as much as digits as its factorization.
133521001541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 133521001541 its reverse (145100125331), we get a palindrome (278621126872).
The spelling of 133521001541 in words is "one hundred thirty-three billion, five hundred twenty-one million, one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •