Base | Representation |
---|---|
bin | 1110100100101… |
… | …1011011000001 |
3 | 11021000112120102 |
4 | 3221023123001 |
5 | 111122020322 |
6 | 10022052145 |
7 | 1341364616 |
oct | 351133301 |
9 | 137015512 |
10 | 61126337 |
11 | 31560138 |
12 | 1857a055 |
13 | c88283c |
14 | 819250d |
15 | 5576792 |
hex | 3a4b6c1 |
61126337 has 2 divisors, whose sum is σ = 61126338. Its totient is φ = 61126336.
The previous prime is 61126297. The next prime is 61126361. The reversal of 61126337 is 73362116.
61126337 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61089856 + 36481 = 7816^2 + 191^2 .
It is a cyclic number.
It is not a de Polignac number, because 61126337 - 212 = 61122241 is a prime.
It is a Chen prime.
It is equal to p3625049 and since 61126337 and 3625049 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (61126397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30563168 + 30563169.
It is an arithmetic number, because the mean of its divisors is an integer number (30563169).
Almost surely, 261126337 is an apocalyptic number.
It is an amenable number.
61126337 is a deficient number, since it is larger than the sum of its proper divisors (1).
61126337 is an equidigital number, since it uses as much as digits as its factorization.
61126337 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4536, while the sum is 29.
The square root of 61126337 is about 7818.3333901798. Note that the first 4 decimals coincide. The cubic root of 61126337 is about 393.9212933390.
The spelling of 61126337 in words is "sixty-one million, one hundred twenty-six thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •