Base | Representation |
---|---|
bin | 10011111011101110101111 |
3 | 100211110220000 |
4 | 103323232233 |
5 | 2314203031 |
6 | 303555343 |
7 | 62262243 |
oct | 23735657 |
9 | 10743800 |
10 | 5225391 |
11 | 2a49a06 |
12 | 18bbb53 |
13 | 110c562 |
14 | 9a0423 |
15 | 6d33e6 |
hex | 4fbbaf |
5225391 has 20 divisors (see below), whose sum is σ = 8061504. Its totient is φ = 3369600.
The previous prime is 5225383. The next prime is 5225401. The reversal of 5225391 is 1935225.
5225391 is a `hidden beast` number, since 522 + 53 + 91 = 666.
It is not a de Polignac number, because 5225391 - 23 = 5225383 is a prime.
It is a super-3 number, since 3×52253913 (a number of 21 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a d-powerful number, because it can be written as 5 + 217 + 217 + 55 + 311 + 97 + 1 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5225371) 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 19 ways as a sum of consecutive naturals, for example, 1471 + ... + 3551.
Almost surely, 25225391 is an apocalyptic number.
5225391 is a deficient number, since it is larger than the sum of its proper divisors (2836113).
5225391 is a wasteful number, since it uses less digits than its factorization.
5225391 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2124 (or 2115 counting only the distinct ones).
The product of its digits is 2700, while the sum is 27.
The square root of 5225391 is about 2285.9114156065. The cubic root of 5225391 is about 173.5293463857.
The spelling of 5225391 in words is "five million, two hundred twenty-five thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •