Base | Representation |
---|---|
bin | 1100011001100… |
… | …0001111011001 |
3 | 10121212001210201 |
4 | 3012120033121 |
5 | 101303110201 |
6 | 5054342201 |
7 | 1201011403 |
oct | 306301731 |
9 | 117761721 |
10 | 52003801 |
11 | 2739a253 |
12 | 154ba961 |
13 | aa0a4a5 |
14 | 6c99b73 |
15 | 4873801 |
hex | 31983d9 |
52003801 has 4 divisors (see below), whose sum is σ = 52037392. Its totient is φ = 51970212.
The previous prime is 52003793. The next prime is 52003829. The reversal of 52003801 is 10830025.
It is a happy number.
52003801 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, 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 52003801 - 23 = 52003793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52003841) 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, 14355 + ... + 17608.
It is an arithmetic number, because the mean of its divisors is an integer number (13009348).
Almost surely, 252003801 is an apocalyptic number.
It is an amenable number.
52003801 is a deficient number, since it is larger than the sum of its proper divisors (33591).
52003801 is a wasteful number, since it uses less digits than its factorization.
52003801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33590.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 52003801 is about 7211.3660980427. The cubic root of 52003801 is about 373.2602098671.
Adding to 52003801 its reverse (10830025), we get a palindrome (62833826).
The spelling of 52003801 in words is "fifty-two million, three thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •