Base | Representation |
---|---|
bin | 1110100011011… |
… | …0011111101101 |
3 | 11020212011222202 |
4 | 3220312133231 |
5 | 111111244441 |
6 | 10020151245 |
7 | 1340556665 |
oct | 350663755 |
9 | 136764882 |
10 | 61040621 |
11 | 315017a4 |
12 | 18538525 |
13 | c852815 |
14 | 816d1a5 |
15 | 555b19b |
hex | 3a367ed |
61040621 has 12 divisors (see below), whose sum is σ = 63725844. Its totient is φ = 58464000.
The previous prime is 61040587. The next prime is 61040627. The reversal of 61040621 is 12604016.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 44521 + 60996100 = 211^2 + 7810^2 .
It is not a de Polignac number, because 61040621 - 218 = 60778477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 61040593 and 61040602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61040627) 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 in 11 ways as a sum of consecutive naturals, for example, 152021 + ... + 152421.
It is an arithmetic number, because the mean of its divisors is an integer number (5310487).
Almost surely, 261040621 is an apocalyptic number.
It is an amenable number.
61040621 is a deficient number, since it is larger than the sum of its proper divisors (2685223).
61040621 is a wasteful number, since it uses less digits than its factorization.
61040621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640 (or 611 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 61040621 is about 7812.8497361718. The cubic root of 61040621 is about 393.7370784035.
Adding to 61040621 its reverse (12604016), we get a palindrome (73644637).
The spelling of 61040621 in words is "sixty-one million, forty thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •