Base | Representation |
---|---|
bin | 10101011101100001010111 |
3 | 101120211100021 |
4 | 111131201113 |
5 | 2420012233 |
6 | 320330011 |
7 | 65551111 |
oct | 25354127 |
9 | 11524307 |
10 | 5625943 |
11 | 31a2944 |
12 | 1a73907 |
13 | 121c97b |
14 | a663b1 |
15 | 761e2d |
hex | 55d857 |
5625943 has 4 divisors (see below), whose sum is σ = 5630688. Its totient is φ = 5621200.
The previous prime is 5625941. The next prime is 5625967. The reversal of 5625943 is 3495265.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 3495265 = 5 ⋅699053.
It is a cyclic number.
It is not a de Polignac number, because 5625943 - 21 = 5625941 is a prime.
It is an Ulam number.
It is a Duffinian number.
It is a nialpdrome in base 7.
It is a junction number, because it is equal to n+sod(n) for n = 5625899 and 5625908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5625941) 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, 1155 + ... + 3547.
It is an arithmetic number, because the mean of its divisors is an integer number (1407672).
Almost surely, 25625943 is an apocalyptic number.
5625943 is a deficient number, since it is larger than the sum of its proper divisors (4745).
5625943 is a wasteful number, since it uses less digits than its factorization.
5625943 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4744.
The product of its digits is 32400, while the sum is 34.
The square root of 5625943 is about 2371.9070386505. The cubic root of 5625943 is about 177.8546028926.
The spelling of 5625943 in words is "five million, six hundred twenty-five thousand, nine hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •