Base | Representation |
---|---|
bin | 1110101001100… |
… | …0001100101101 |
3 | 11021121111221200 |
4 | 3222120030231 |
5 | 111212101223 |
6 | 10032520113 |
7 | 1344144510 |
oct | 352301455 |
9 | 137544850 |
10 | 61440813 |
11 | 31755435 |
12 | 186b0039 |
13 | c962a15 |
14 | 8234d77 |
15 | 55d9a43 |
hex | 3a9832d |
61440813 has 24 divisors (see below), whose sum is σ = 106766400. Its totient is φ = 33260544.
The previous prime is 61440787. The next prime is 61440817. The reversal of 61440813 is 31804416.
61440813 is a `hidden beast` number, since 614 + 40 + 8 + 1 + 3 = 666.
61440813 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 61440813 - 210 = 61439789 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61440817) 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 23 ways as a sum of consecutive naturals, for example, 24468 + ... + 26861.
It is an arithmetic number, because the mean of its divisors is an integer number (4448600).
Almost surely, 261440813 is an apocalyptic number.
61440813 is a gapful number since it is divisible by the number (63) formed by its first and last digit.
It is an amenable number.
61440813 is a deficient number, since it is larger than the sum of its proper divisors (45325587).
61440813 is a wasteful number, since it uses less digits than its factorization.
61440813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51361 (or 51358 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 61440813 is about 7838.4190370253. The cubic root of 61440813 is about 394.5956723630.
The spelling of 61440813 in words is "sixty-one million, four hundred forty thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •