Base | Representation |
---|---|
bin | 10100000101101111000000 |
3 | 100220120002200 |
4 | 110011233000 |
5 | 2322010433 |
6 | 304513200 |
7 | 62522562 |
oct | 24055700 |
9 | 10816080 |
10 | 5266368 |
11 | 2a77778 |
12 | 191b800 |
13 | 11250c3 |
14 | 9b1332 |
15 | 6e0613 |
hex | 505bc0 |
5266368 has 84 divisors (see below), whose sum is σ = 15532608. Its totient is φ = 1704960.
The previous prime is 5266361. The next prime is 5266381. The reversal of 5266368 is 8636625.
It is a super-3 number, since 3×52663683 (a number of 21 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5266361) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23505 + ... + 23727.
It is an arithmetic number, because the mean of its divisors is an integer number (184912).
Almost surely, 25266368 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5266368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7766304).
5266368 is an abundant number, since it is smaller than the sum of its proper divisors (10266240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5266368 is a wasteful number, since it uses less digits than its factorization.
5266368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282 (or 269 counting only the distinct ones).
The product of its digits is 51840, while the sum is 36.
The square root of 5266368 is about 2294.8568582811. The cubic root of 5266368 is about 173.9817658261.
The spelling of 5266368 in words is "five million, two hundred sixty-six thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •