Base | Representation |
---|---|
bin | 1110100110101… |
… | …0010100010101 |
3 | 11021020222011101 |
4 | 3221222110111 |
5 | 111140043020 |
6 | 10024510101 |
7 | 1342432561 |
oct | 351522425 |
9 | 137228141 |
10 | 61252885 |
11 | 31637221 |
12 | 1861b331 |
13 | c8c8315 |
14 | 81c66a1 |
15 | 559e00a |
hex | 3a6a515 |
61252885 has 8 divisors (see below), whose sum is σ = 73556280. Its totient is φ = 48967104.
The previous prime is 61252879. The next prime is 61252889. The reversal of 61252885 is 58825216.
61252885 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 2852721 + 58400164 = 1689^2 + 7642^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 61252885 - 27 = 61252757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61252889) 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, 5131 + ... + 12199.
It is an arithmetic number, because the mean of its divisors is an integer number (9194535).
Almost surely, 261252885 is an apocalyptic number.
It is an amenable number.
61252885 is a deficient number, since it is larger than the sum of its proper divisors (12303395).
61252885 is a wasteful number, since it uses less digits than its factorization.
61252885 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8807.
The product of its digits is 38400, while the sum is 37.
The square root of 61252885 is about 7826.4222349679. The cubic root of 61252885 is about 394.1929470584.
The spelling of 61252885 in words is "sixty-one million, two hundred fifty-two thousand, eight hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •