Base | Representation |
---|---|
bin | 10100000000000101001000 |
3 | 100212101022220 |
4 | 110000011020 |
5 | 2320240313 |
6 | 304214040 |
7 | 62365215 |
oct | 24000510 |
9 | 10771286 |
10 | 5243208 |
11 | 2a61333 |
12 | 190a320 |
13 | 11176b9 |
14 | 9a6b0c |
15 | 6d8823 |
hex | 500148 |
5243208 has 64 divisors (see below), whose sum is σ = 14152320. Its totient is φ = 1612800.
The previous prime is 5243207. The next prime is 5243239. The reversal of 5243208 is 8023425.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a d-powerful number, because it can be written as 5 + 220 + 42 + 35 + 222 + 0 + 82 .
It is not an unprimeable number, because it can be changed into a prime (5243201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28878 + ... + 29058.
It is an arithmetic number, because the mean of its divisors is an integer number (221130).
Almost surely, 25243208 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 5243208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7076160).
5243208 is an abundant number, since it is smaller than the sum of its proper divisors (8909112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5243208 is a wasteful number, since it uses less digits than its factorization.
5243208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278 (or 274 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 5243208 is about 2289.8052318920. The cubic root of 5243208 is about 173.7263501444.
The spelling of 5243208 in words is "five million, two hundred forty-three thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •