Base | Representation |
---|---|
bin | 10011010011010111010101 |
3 | 100112002002101 |
4 | 103103113111 |
5 | 2243410203 |
6 | 300242101 |
7 | 61003225 |
oct | 23232725 |
9 | 10462071 |
10 | 5060053 |
11 | 2946769 |
12 | 1840331 |
13 | 108221b |
14 | 95a085 |
15 | 69e41d |
hex | 4d35d5 |
5060053 has 2 divisors, whose sum is σ = 5060054. Its totient is φ = 5060052.
The previous prime is 5060051. The next prime is 5060063. The reversal of 5060053 is 3500605.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5026564 + 33489 = 2242^2 + 183^2 .
It is a cyclic number.
It is not a de Polignac number, because 5060053 - 21 = 5060051 is a prime.
Together with 5060051, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 5060053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5060051) 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 as a sum of consecutive naturals, namely, 2530026 + 2530027.
It is an arithmetic number, because the mean of its divisors is an integer number (2530027).
Almost surely, 25060053 is an apocalyptic number.
It is an amenable number.
5060053 is a deficient number, since it is larger than the sum of its proper divisors (1).
5060053 is an equidigital number, since it uses as much as digits as its factorization.
5060053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 19.
The square root of 5060053 is about 2249.4561564965. The cubic root of 5060053 is about 171.6794665836.
Adding to 5060053 its reverse (3500605), we get a palindrome (8560658).
It can be divided in two parts, 50600 and 53, that added together give a cube (50653 = 373).
The spelling of 5060053 in words is "five million, sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •