Base | Representation |
---|---|
bin | 10011111011110101011111 |
3 | 100211111111000 |
4 | 103323311133 |
5 | 2314211243 |
6 | 304001343 |
7 | 62263431 |
oct | 23736537 |
9 | 10744430 |
10 | 5225823 |
11 | 2a4a269 |
12 | 1900253 |
13 | 110c805 |
14 | 9a0651 |
15 | 6d35d3 |
hex | 4fbd5f |
5225823 has 8 divisors (see below), whose sum is σ = 7742000. Its totient is φ = 3483864.
The previous prime is 5225821. The next prime is 5225839. The reversal of 5225823 is 3285225.
It is not a de Polignac number, because 5225823 - 21 = 5225821 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 193549 = 5225823 / (5 + 2 + 2 + 5 + 8 + 2 + 3).
It is a d-powerful number, because it can be written as 5 + 210 + 211 + 58 + 85 + 214 + 314 .
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5225821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96748 + ... + 96801.
It is an arithmetic number, because the mean of its divisors is an integer number (967750).
Almost surely, 25225823 is an apocalyptic number.
5225823 is a deficient number, since it is larger than the sum of its proper divisors (2516177).
5225823 is a wasteful number, since it uses less digits than its factorization.
5225823 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193558 (or 193552 counting only the distinct ones).
The product of its digits is 4800, while the sum is 27.
The square root of 5225823 is about 2286.0059055042. The cubic root of 5225823 is about 173.5341283316.
Subtracting from 5225823 its sum of digits (27), we obtain a square (5225796 = 22862).
The spelling of 5225823 in words is "five million, two hundred twenty-five thousand, eight hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •