Base | Representation |
---|---|
bin | 10100010111100111101100 |
3 | 101001021121000 |
4 | 110113213230 |
5 | 2331332003 |
6 | 310240300 |
7 | 63246300 |
oct | 24274754 |
9 | 11037530 |
10 | 5339628 |
11 | 3017818 |
12 | 1956090 |
13 | 114c558 |
14 | 9cdd00 |
15 | 7071a3 |
hex | 5179ec |
5339628 has 72 divisors (see below), whose sum is σ = 16119600. Its totient is φ = 1524096.
The previous prime is 5339617. The next prime is 5339629. The reversal of 5339628 is 8269335.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a d-powerful number, because it can be written as 56 + 312 + 314 + 93 + 65 + 210 + 82 .
It is a junction number, because it is equal to n+sod(n) for n = 5339592 and 5339601.
It is not an unprimeable number, because it can be changed into a prime (5339629) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4788 + ... + 5796.
Almost surely, 25339628 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 5339628, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8059800).
5339628 is an abundant number, since it is smaller than the sum of its proper divisors (10779972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5339628 is a wasteful number, since it uses less digits than its factorization.
5339628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1036 (or 1021 counting only the distinct ones).
The product of its digits is 38880, while the sum is 36.
The square root of 5339628 is about 2310.7635101845. The cubic root of 5339628 is about 174.7848021459.
The spelling of 5339628 in words is "five million, three hundred thirty-nine thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •