Base | Representation |
---|---|
bin | 10011100111100010101101 |
3 | 100200021110102 |
4 | 103213202231 |
5 | 2304031301 |
6 | 302120445 |
7 | 61466204 |
oct | 23474255 |
9 | 10607412 |
10 | 5142701 |
11 | 29a2873 |
12 | 1880125 |
13 | 10b0a25 |
14 | 97c23b |
15 | 6b8b6b |
hex | 4e78ad |
5142701 has 4 divisors (see below), whose sum is σ = 5150400. Its totient is φ = 5135004.
The previous prime is 5142689. The next prime is 5142713. The reversal of 5142701 is 1072415.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1072415 = 5 ⋅214483.
It is an interprime number because it is at equal distance from previous prime (5142689) and next prime (5142713).
It is a cyclic number.
It is not a de Polignac number, because 5142701 - 26 = 5142637 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5142751) 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, 2741 + ... + 4218.
It is an arithmetic number, because the mean of its divisors is an integer number (1287600).
Almost surely, 25142701 is an apocalyptic number.
It is an amenable number.
5142701 is a deficient number, since it is larger than the sum of its proper divisors (7699).
5142701 is an equidigital number, since it uses as much as digits as its factorization.
5142701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7698.
The product of its (nonzero) digits is 280, while the sum is 20.
The square root of 5142701 is about 2267.7524115300. The cubic root of 5142701 is about 172.6091278958.
The spelling of 5142701 in words is "five million, one hundred forty-two thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •