Base | Representation |
---|---|
bin | 111101000001000110… |
… | …0011111100101110001 |
3 | 110112012221022221202101 |
4 | 1322002030133211301 |
5 | 4121324013111311 |
6 | 140110151020401 |
7 | 12316061642221 |
oct | 1720214374561 |
9 | 415187287671 |
10 | 131033332081 |
11 | 50630999893 |
12 | 2148a96a701 |
13 | c482cb2532 |
14 | 64b0812081 |
15 | 361d92aec1 |
hex | 1e8231f971 |
131033332081 has 2 divisors, whose sum is σ = 131033332082. Its totient is φ = 131033332080.
The previous prime is 131033332043. The next prime is 131033332121. The reversal of 131033332081 is 180233330131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104614080481 + 26419251600 = 323441^2 + 162540^2 .
It is an emirp because it is prime and its reverse (180233330131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131033332081 is a prime.
It is a super-2 number, since 2×1310333320812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131033332181) 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, 65516666040 + 65516666041.
It is an arithmetic number, because the mean of its divisors is an integer number (65516666041).
Almost surely, 2131033332081 is an apocalyptic number.
It is an amenable number.
131033332081 is a deficient number, since it is larger than the sum of its proper divisors (1).
131033332081 is an equidigital number, since it uses as much as digits as its factorization.
131033332081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
The spelling of 131033332081 in words is "one hundred thirty-one billion, thirty-three million, three hundred thirty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •