Base | Representation |
---|---|
bin | 111110100011011000… |
… | …0100110100010000101 |
3 | 110211201202201112211111 |
4 | 1331012300212202011 |
5 | 4200102232211122 |
6 | 141413314205021 |
7 | 12463564532314 |
oct | 1750660464205 |
9 | 424652645744 |
10 | 134331132037 |
11 | 51a734707a3 |
12 | 2204b283771 |
13 | c88a2a435b |
14 | 67047b827b |
15 | 37631e6d77 |
hex | 1f46c26885 |
134331132037 has 2 divisors, whose sum is σ = 134331132038. Its totient is φ = 134331132036.
The previous prime is 134331132031. The next prime is 134331132053. The reversal of 134331132037 is 730231133431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 121292689441 + 13038442596 = 348271^2 + 114186^2 .
It is a cyclic number.
It is not a de Polignac number, because 134331132037 - 227 = 134196914309 is a prime.
It is a super-3 number, since 3×1343311320373 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134331132031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67165566018 + 67165566019.
It is an arithmetic number, because the mean of its divisors is an integer number (67165566019).
Almost surely, 2134331132037 is an apocalyptic number.
It is an amenable number.
134331132037 is a deficient number, since it is larger than the sum of its proper divisors (1).
134331132037 is an equidigital number, since it uses as much as digits as its factorization.
134331132037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 31.
Adding to 134331132037 its reverse (730231133431), we get a palindrome (864562265468).
The spelling of 134331132037 in words is "one hundred thirty-four billion, three hundred thirty-one million, one hundred thirty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •