Base | Representation |
---|---|
bin | 11110001111101101000001… |
… | …001001011111010111011111 |
3 | 122102222122020002221021002112 |
4 | 132033231001021133113133 |
5 | 114413402013413144411 |
6 | 1150524441410144235 |
7 | 40006262421536363 |
oct | 3617550111372737 |
9 | 572878202837075 |
10 | 133020525131231 |
11 | 39425762664881 |
12 | 12b0432888207b |
13 | 592ba2150394a |
14 | 24bc328dd52a3 |
15 | 105a280bd7b8b |
hex | 78fb4125f5df |
133020525131231 has 2 divisors, whose sum is σ = 133020525131232. Its totient is φ = 133020525131230.
The previous prime is 133020525131177. The next prime is 133020525131267. The reversal of 133020525131231 is 132131525020331.
It is a strong prime.
It is an emirp because it is prime and its reverse (132131525020331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133020525131231 is a prime.
It is a super-2 number, since 2×1330205251312312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133020525131281) 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, 66510262565615 + 66510262565616.
It is an arithmetic number, because the mean of its divisors is an integer number (66510262565616).
Almost surely, 2133020525131231 is an apocalyptic number.
133020525131231 is a deficient number, since it is larger than the sum of its proper divisors (1).
133020525131231 is an equidigital number, since it uses as much as digits as its factorization.
133020525131231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 32.
The spelling of 133020525131231 in words is "one hundred thirty-three trillion, twenty billion, five hundred twenty-five million, one hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •