Base | Representation |
---|---|
bin | 1110100100110… |
… | …0101001001101 |
3 | 11021000210102202 |
4 | 3221030221031 |
5 | 111122200331 |
6 | 10022131245 |
7 | 1341415325 |
oct | 351145115 |
9 | 137023382 |
10 | 61131341 |
11 | 31563977 |
12 | 18580b25 |
13 | c884bbb |
14 | 8194285 |
15 | 5577ecb |
hex | 3a4ca4d |
61131341 has 8 divisors (see below), whose sum is σ = 65073600. Its totient is φ = 57261600.
The previous prime is 61131319. The next prime is 61131383. The reversal of 61131341 is 14313116.
61131341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-61131341 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61131241) 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 in 7 ways as a sum of consecutive naturals, for example, 16385 + ... + 19766.
It is an arithmetic number, because the mean of its divisors is an integer number (8134200).
Almost surely, 261131341 is an apocalyptic number.
It is an amenable number.
61131341 is a deficient number, since it is larger than the sum of its proper divisors (3942259).
61131341 is a wasteful number, since it uses less digits than its factorization.
61131341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36259.
The product of its digits is 216, while the sum is 20.
The square root of 61131341 is about 7818.6534006822. The cubic root of 61131341 is about 393.9320422701.
Adding to 61131341 its reverse (14313116), we get a palindrome (75444457).
The spelling of 61131341 in words is "sixty-one million, one hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •