Base | Representation |
---|---|
bin | 1100011010011… |
… | …1100110110101 |
3 | 10121222021010211 |
4 | 3012213212311 |
5 | 101312113431 |
6 | 5055545421 |
7 | 1201363036 |
oct | 306474665 |
9 | 117867124 |
10 | 52066741 |
11 | 27432571 |
12 | 1552b271 |
13 | aa3002c |
14 | 6cb4a8d |
15 | 48872b1 |
hex | 31a79b5 |
52066741 has 4 divisors (see below), whose sum is σ = 53174592. Its totient is φ = 50958892.
The previous prime is 52066727. The next prime is 52066769. The reversal of 52066741 is 14766025.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 52066741 - 29 = 52066229 is a prime.
It is a super-2 number, since 2×520667412 = 5421891036722162, which contains 22 as substring.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52066711) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 553855 + ... + 553948.
It is an arithmetic number, because the mean of its divisors is an integer number (13293648).
Almost surely, 252066741 is an apocalyptic number.
It is an amenable number.
52066741 is a deficient number, since it is larger than the sum of its proper divisors (1107851).
52066741 is a wasteful number, since it uses less digits than its factorization.
52066741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1107850.
The product of its (nonzero) digits is 10080, while the sum is 31.
The square root of 52066741 is about 7215.7287227279. The cubic root of 52066741 is about 373.4107342884.
The spelling of 52066741 in words is "fifty-two million, sixty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •