Base | Representation |
---|---|
bin | 1100100110111… |
… | …1010100000101 |
3 | 10200111211020010 |
4 | 3021233110011 |
5 | 102014302431 |
6 | 5125300433 |
7 | 1211340630 |
oct | 311572405 |
9 | 120454203 |
10 | 52884741 |
11 | 279410a8 |
12 | 15864719 |
13 | ac58460 |
14 | 7048c17 |
15 | 4999846 |
hex | 326f505 |
52884741 has 32 divisors (see below), whose sum is σ = 87205888. Its totient is φ = 27760320.
The previous prime is 52884731. The next prime is 52884749. The reversal of 52884741 is 14748825.
It is a happy number.
52884741 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 52884741 - 26 = 52884677 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 52884741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52884749) 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 31 ways as a sum of consecutive naturals, for example, 83496 + ... + 84126.
It is an arithmetic number, because the mean of its divisors is an integer number (2725184).
Almost surely, 252884741 is an apocalyptic number.
It is an amenable number.
52884741 is a deficient number, since it is larger than the sum of its proper divisors (34321147).
52884741 is a wasteful number, since it uses less digits than its factorization.
52884741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 961.
The product of its digits is 71680, while the sum is 39.
The square root of 52884741 is about 7272.1895602356. The cubic root of 52884741 is about 375.3560848802.
The spelling of 52884741 in words is "fifty-two million, eight hundred eighty-four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •