Base | Representation |
---|---|
bin | 1100100111011… |
… | …0111010100001 |
3 | 10200120101221011 |
4 | 3021312322201 |
5 | 102021301443 |
6 | 5130100521 |
7 | 1211530453 |
oct | 311667241 |
9 | 120511834 |
10 | 52915873 |
11 | 2796252a |
12 | 1587a741 |
13 | ac6968a |
14 | 70562d3 |
15 | 49a3b9d |
hex | 3276ea1 |
52915873 has 4 divisors (see below), whose sum is σ = 52970688. Its totient is φ = 52861060.
The previous prime is 52915867. The next prime is 52915879. The reversal of 52915873 is 37851925.
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 an interprime number because it is at equal distance from previous prime (52915867) and next prime (52915879).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52915873 is a prime.
It is a Smith number, since the sum of its digits (40) 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 not an unprimeable number, because it can be changed into a prime (52915879) 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, 25933 + ... + 27898.
It is an arithmetic number, because the mean of its divisors is an integer number (13242672).
Almost surely, 252915873 is an apocalyptic number.
It is an amenable number.
52915873 is a deficient number, since it is larger than the sum of its proper divisors (54815).
52915873 is an equidigital number, since it uses as much as digits as its factorization.
52915873 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54814.
The product of its digits is 75600, while the sum is 40.
The square root of 52915873 is about 7274.3297285729. The cubic root of 52915873 is about 375.4297248575.
The spelling of 52915873 in words is "fifty-two million, nine hundred fifteen thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •