Base | Representation |
---|---|
bin | 1100011001110… |
… | …1110000101101 |
3 | 10121220012211012 |
4 | 3012131300231 |
5 | 101304321123 |
6 | 5055035005 |
7 | 1201134335 |
oct | 306356055 |
9 | 117805735 |
10 | 52026413 |
11 | 2740523a |
12 | 1550ba65 |
13 | aa1787a |
14 | 6ca40c5 |
15 | 487a378 |
hex | 319dc2d |
52026413 has 8 divisors (see below), whose sum is σ = 52720536. Its totient is φ = 51336000.
The previous prime is 52026407. The next prime is 52026419. The reversal of 52026413 is 31462025.
It is an interprime number because it is at equal distance from previous prime (52026407) and next prime (52026419).
It can be written as a sum of positive squares in 4 ways, for example, as 20811844 + 31214569 = 4562^2 + 5587^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52026413 - 26 = 52026349 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52026419) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36983 + ... + 38363.
It is an arithmetic number, because the mean of its divisors is an integer number (6590067).
Almost surely, 252026413 is an apocalyptic number.
It is an amenable number.
52026413 is a deficient number, since it is larger than the sum of its proper divisors (694123).
52026413 is a wasteful number, since it uses less digits than its factorization.
52026413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1855.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 52026413 is about 7212.9337304595. The cubic root of 52026413 is about 373.3143016623.
Adding to 52026413 its reverse (31462025), we get a palindrome (83488438).
The spelling of 52026413 in words is "fifty-two million, twenty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •