Base | Representation |
---|---|
bin | 1100011001110… |
… | …1110110011101 |
3 | 10121220020022211 |
4 | 3012131312131 |
5 | 101304324111 |
6 | 5055040421 |
7 | 1201135402 |
oct | 306356635 |
9 | 117806284 |
10 | 52026781 |
11 | 27405544 |
12 | 15510111 |
13 | aa17aa1 |
14 | 6ca42a9 |
15 | 487a521 |
hex | 319dd9d |
52026781 has 4 divisors (see below), whose sum is σ = 52424064. Its totient is φ = 51629500.
The previous prime is 52026763. The next prime is 52026833. The reversal of 52026781 is 18762025.
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 52026781 - 29 = 52026269 is a prime.
It is a super-2 number, since 2×520267812 = 5413571882443922, 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 (52026701) 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, 198445 + ... + 198706.
It is an arithmetic number, because the mean of its divisors is an integer number (13106016).
Almost surely, 252026781 is an apocalyptic number.
It is an amenable number.
52026781 is a deficient number, since it is larger than the sum of its proper divisors (397283).
52026781 is a wasteful number, since it uses less digits than its factorization.
52026781 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 397282.
The product of its (nonzero) digits is 6720, while the sum is 31.
The square root of 52026781 is about 7212.9592401455. The cubic root of 52026781 is about 373.3151818520.
The spelling of 52026781 in words is "fifty-two million, twenty-six thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •