Base | Representation |
---|---|
bin | 1110100011000… |
… | …1101001001101 |
3 | 11020211011201202 |
4 | 3220301221031 |
5 | 111110130444 |
6 | 10015515245 |
7 | 1340445026 |
oct | 350615115 |
9 | 136734652 |
10 | 61020749 |
11 | 31498879 |
12 | 18528b25 |
13 | c84676a |
14 | 8165c4d |
15 | 555534e |
hex | 3a31a4d |
61020749 has 4 divisors (see below), whose sum is σ = 61037436. Its totient is φ = 61004064.
The previous prime is 61020731. The next prime is 61020779. The reversal of 61020749 is 94702016.
61020749 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14303524 + 46717225 = 3782^2 + 6835^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-61020749 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61020779) 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 3 ways as a sum of consecutive naturals, for example, 224 + ... + 11049.
It is an arithmetic number, because the mean of its divisors is an integer number (15259359).
Almost surely, 261020749 is an apocalyptic number.
It is an amenable number.
61020749 is a deficient number, since it is larger than the sum of its proper divisors (16687).
61020749 is a wasteful number, since it uses less digits than its factorization.
61020749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16686.
The product of its (nonzero) digits is 3024, while the sum is 29.
The square root of 61020749 is about 7811.5778815806. The cubic root of 61020749 is about 393.6943462451.
The spelling of 61020749 in words is "sixty-one million, twenty thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •