Base | Representation |
---|---|
bin | 111110100011000101… |
… | …0011000010101110101 |
3 | 110211201001212111112012 |
4 | 1331012022120111311 |
5 | 4200042201044222 |
6 | 141412315334005 |
7 | 12463413421541 |
oct | 1750612302565 |
9 | 424631774465 |
10 | 134321112437 |
11 | 51a68847936 |
12 | 22047a51305 |
13 | c8881a68b5 |
14 | 670332aa21 |
15 | 37623b81e2 |
hex | 1f46298575 |
134321112437 has 2 divisors, whose sum is σ = 134321112438. Its totient is φ = 134321112436.
The previous prime is 134321112397. The next prime is 134321112449. The reversal of 134321112437 is 734211123431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129225151441 + 5095960996 = 359479^2 + 71386^2 .
It is a cyclic number.
It is not a de Polignac number, because 134321112437 - 228 = 134052676981 is a prime.
It is a super-2 number, since 2×1343211124372 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134321114437) 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, 67160556218 + 67160556219.
It is an arithmetic number, because the mean of its divisors is an integer number (67160556219).
Almost surely, 2134321112437 is an apocalyptic number.
It is an amenable number.
134321112437 is a deficient number, since it is larger than the sum of its proper divisors (1).
134321112437 is an equidigital number, since it uses as much as digits as its factorization.
134321112437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12096, while the sum is 32.
Adding to 134321112437 its reverse (734211123431), we get a palindrome (868532235868).
The spelling of 134321112437 in words is "one hundred thirty-four billion, three hundred twenty-one million, one hundred twelve thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •