Base | Representation |
---|---|
bin | 10101101110000100110100 |
3 | 101201021100120 |
4 | 111232010310 |
5 | 2424144443 |
6 | 322011540 |
7 | 66252564 |
oct | 25560464 |
9 | 11637316 |
10 | 5693748 |
11 | 3239885 |
12 | 1aa6bb0 |
13 | 12447a8 |
14 | a82da4 |
15 | 777083 |
hex | 56e134 |
5693748 has 12 divisors (see below), whose sum is σ = 13285440. Its totient is φ = 1897912.
The previous prime is 5693747. The next prime is 5693771. The reversal of 5693748 is 8473965.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5693741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 237228 + ... + 237251.
It is an arithmetic number, because the mean of its divisors is an integer number (1107120).
Almost surely, 25693748 is an apocalyptic number.
It is an amenable number.
5693748 is an abundant number, since it is smaller than the sum of its proper divisors (7591692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5693748 is a wasteful number, since it uses less digits than its factorization.
5693748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474486 (or 474484 counting only the distinct ones).
The product of its digits is 181440, while the sum is 42.
The square root of 5693748 is about 2386.1575807142. The cubic root of 5693748 is about 178.5662646583.
It can be divided in two parts, 5693 and 748, that added together give a triangular number (6441 = T113).
The spelling of 5693748 in words is "five million, six hundred ninety-three thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •