Base | Representation |
---|---|
bin | 1111111110101… |
… | …01100110000101 |
3 | 100100020010211222 |
4 | 13333111212011 |
5 | 233303402122 |
6 | 21145010125 |
7 | 3215232641 |
oct | 777254605 |
9 | 310203758 |
10 | 134044037 |
11 | 697342a6 |
12 | 38a83945 |
13 | 21a033ca |
14 | 13b33c21 |
15 | bb7bb42 |
hex | 7fd5985 |
134044037 has 2 divisors, whose sum is σ = 134044038. Its totient is φ = 134044036.
The previous prime is 134043983. The next prime is 134044039. The reversal of 134044037 is 730440431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115648516 + 18395521 = 10754^2 + 4289^2 .
It is a cyclic number.
It is not a de Polignac number, because 134044037 - 28 = 134043781 is a prime.
Together with 134044039, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 134043997 and 134044015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134044039) 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, 67022018 + 67022019.
It is an arithmetic number, because the mean of its divisors is an integer number (67022019).
Almost surely, 2134044037 is an apocalyptic number.
It is an amenable number.
134044037 is a deficient number, since it is larger than the sum of its proper divisors (1).
134044037 is an equidigital number, since it uses as much as digits as its factorization.
134044037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 26.
The square root of 134044037 is about 11577.7388552342. The cubic root of 134044037 is about 511.7790451325.
Adding to 134044037 its reverse (730440431), we get a palindrome (864484468).
The spelling of 134044037 in words is "one hundred thirty-four million, forty-four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •