Base | Representation |
---|---|
bin | 1110100100110… |
… | …0100101000001 |
3 | 11021000210001211 |
4 | 3221030211001 |
5 | 111122143243 |
6 | 10022130121 |
7 | 1341414463 |
oct | 351144501 |
9 | 137023054 |
10 | 61131073 |
11 | 31563753 |
12 | 18580941 |
13 | c884a43 |
14 | 8194133 |
15 | 5577d9d |
hex | 3a4c941 |
61131073 has 2 divisors, whose sum is σ = 61131074. Its totient is φ = 61131072.
The previous prime is 61131061. The next prime is 61131097. The reversal of 61131073 is 37013116.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53246209 + 7884864 = 7297^2 + 2808^2 .
It is a cyclic number.
It is not a de Polignac number, because 61131073 - 217 = 61000001 is a prime.
It is a super-2 number, since 2×611310732 = 7474016172262658, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (61131023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30565536 + 30565537.
It is an arithmetic number, because the mean of its divisors is an integer number (30565537).
Almost surely, 261131073 is an apocalyptic number.
It is an amenable number.
61131073 is a deficient number, since it is larger than the sum of its proper divisors (1).
61131073 is an equidigital number, since it uses as much as digits as its factorization.
61131073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 22.
The square root of 61131073 is about 7818.6362621623. The cubic root of 61131073 is about 393.9314666028.
Adding to 61131073 its reverse (37013116), we get a palindrome (98144189).
It can be divided in two parts, 611 and 31073, that added together give a square (31684 = 1782).
The spelling of 61131073 in words is "sixty-one million, one hundred thirty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •