Base | Representation |
---|---|
bin | 1100011001101… |
… | …0110101000011 |
3 | 10121212121100101 |
4 | 3012122311003 |
5 | 101303430103 |
6 | 5054503231 |
7 | 1201054330 |
oct | 306326503 |
9 | 117777311 |
10 | 52014403 |
11 | 273a7211 |
12 | 15504b17 |
13 | aa1226c |
14 | 6c9d987 |
15 | 4876a1d |
hex | 319ad43 |
52014403 has 4 divisors (see below), whose sum is σ = 59445040. Its totient is φ = 44583768.
The previous prime is 52014401. The next prime is 52014409. The reversal of 52014403 is 30441025.
52014403 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.
It is a cyclic number.
It is not a de Polignac number, because 52014403 - 21 = 52014401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52014401) 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, 3715308 + ... + 3715321.
It is an arithmetic number, because the mean of its divisors is an integer number (14861260).
Almost surely, 252014403 is an apocalyptic number.
52014403 is a deficient number, since it is larger than the sum of its proper divisors (7430637).
52014403 is an equidigital number, since it uses as much as digits as its factorization.
52014403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7430636.
The product of its (nonzero) digits is 480, while the sum is 19.
The square root of 52014403 is about 7212.1011501503. The cubic root of 52014403 is about 373.2855736276.
Adding to 52014403 its reverse (30441025), we get a palindrome (82455428).
It can be divided in two parts, 5201 and 4403, that added together give a square (9604 = 982).
The spelling of 52014403 in words is "fifty-two million, fourteen thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •