Base | Representation |
---|---|
bin | 10011111011111111000011 |
3 | 100211112022200 |
4 | 103323333003 |
5 | 2314221220 |
6 | 304004243 |
7 | 62265264 |
oct | 23737703 |
9 | 10745280 |
10 | 5226435 |
11 | 2a4a775 |
12 | 1900683 |
13 | 110cb86 |
14 | 9a096b |
15 | 6d3890 |
hex | 4fbfc3 |
5226435 has 48 divisors (see below), whose sum is σ = 9650784. Its totient is φ = 2612736.
The previous prime is 5226433. The next prime is 5226437. The reversal of 5226435 is 5346225.
5226435 is a `hidden beast` number, since 5 + 226 + 435 = 666.
5226435 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (5226433) and next prime (5226437).
It is not a de Polignac number, because 5226435 - 21 = 5226433 is a prime.
It is an Ulam number.
It is a d-powerful number, because it can be written as 58 + 213 + 222 + 6 + 48 + 311 + 58 .
It is a junction number, because it is equal to n+sod(n) for n = 5226399 and 5226408.
It is not an unprimeable number, because it can be changed into a prime (5226433) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 71559 + ... + 71631.
It is an arithmetic number, because the mean of its divisors is an integer number (201058).
Almost surely, 25226435 is an apocalyptic number.
5226435 is a deficient number, since it is larger than the sum of its proper divisors (4424349).
5226435 is a wasteful number, since it uses less digits than its factorization.
5226435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164 (or 161 counting only the distinct ones).
The product of its digits is 7200, while the sum is 27.
The square root of 5226435 is about 2286.1397595073. The cubic root of 5226435 is about 173.5409023039.
The spelling of 5226435 in words is "five million, two hundred twenty-six thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •