Base | Representation |
---|---|
bin | 1100011011011… |
… | …0011111100001 |
3 | 10122002100210001 |
4 | 3012312133201 |
5 | 101321041323 |
6 | 5101140001 |
7 | 1202035561 |
oct | 306663741 |
9 | 118070701 |
10 | 52127713 |
11 | 27474360 |
12 | 1555a601 |
13 | aa51a01 |
14 | 6cccda1 |
15 | 489a3ad |
hex | 31b67e1 |
52127713 has 4 divisors (see below), whose sum is σ = 56866608. Its totient is φ = 47388820.
The previous prime is 52127711. The next prime is 52127717. The reversal of 52127713 is 31772125.
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 52127713 - 21 = 52127711 is a prime.
It is a super-2 number, since 2×521277132 = 5434596925220738, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52127711) 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, 2369431 + ... + 2369452.
It is an arithmetic number, because the mean of its divisors is an integer number (14216652).
Almost surely, 252127713 is an apocalyptic number.
It is an amenable number.
52127713 is a deficient number, since it is larger than the sum of its proper divisors (4738895).
52127713 is a wasteful number, since it uses less digits than its factorization.
52127713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4738894.
The product of its digits is 2940, while the sum is 28.
The square root of 52127713 is about 7219.9524236660. The cubic root of 52127713 is about 373.5564364994.
Adding to 52127713 its reverse (31772125), we get a palindrome (83899838).
It can be divided in two parts, 52 and 127713, that added together give a triangular number (127765 = T505).
The spelling of 52127713 in words is "fifty-two million, one hundred twenty-seven thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •