Base | Representation |
---|---|
bin | 111110100101011101… |
… | …1100101011100100101 |
3 | 110211220122102022022122 |
4 | 1331022323211130211 |
5 | 4200223141320122 |
6 | 141424254235325 |
7 | 12465404446052 |
oct | 1751273453445 |
9 | 424818368278 |
10 | 134401120037 |
11 | 51aa9a23818 |
12 | 2206a7b5b45 |
13 | c89b93a582 |
14 | 670dbd6029 |
15 | 376941e142 |
hex | 1f4aee5725 |
134401120037 has 2 divisors, whose sum is σ = 134401120038. Its totient is φ = 134401120036.
The previous prime is 134401120033. The next prime is 134401120043. The reversal of 134401120037 is 730021104431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100616474401 + 33784645636 = 317201^2 + 183806^2 .
It is a cyclic number.
It is not a de Polignac number, because 134401120037 - 22 = 134401120033 is a prime.
It is a super-2 number, since 2×1344011200372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134401119988 and 134401120015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134401120033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67200560018 + 67200560019.
It is an arithmetic number, because the mean of its divisors is an integer number (67200560019).
Almost surely, 2134401120037 is an apocalyptic number.
It is an amenable number.
134401120037 is a deficient number, since it is larger than the sum of its proper divisors (1).
134401120037 is an equidigital number, since it uses as much as digits as its factorization.
134401120037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 134401120037 its reverse (730021104431), we get a palindrome (864422224468).
The spelling of 134401120037 in words is "one hundred thirty-four billion, four hundred one million, one hundred twenty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •