Base | Representation |
---|---|
bin | 11010010010111010110110 |
3 | 110222012202010 |
4 | 122102322312 |
5 | 3231040423 |
6 | 403425050 |
7 | 112406622 |
oct | 32227266 |
9 | 13865663 |
10 | 6893238 |
11 | 3988aa0 |
12 | 2385186 |
13 | 1574751 |
14 | cb6182 |
15 | 912693 |
hex | 692eb6 |
6893238 has 64 divisors (see below), whose sum is σ = 16588800. Its totient is φ = 1884960.
The previous prime is 6893221. The next prime is 6893239. The reversal of 6893238 is 8323986.
6893238 is nontrivially palindromic in base 13.
It is a junction number, because it is equal to n+sod(n) for n = 6893196 and 6893205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6893239) 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 31 ways as a sum of consecutive naturals, for example, 28723 + ... + 28961.
It is an arithmetic number, because the mean of its divisors is an integer number (259200).
Almost surely, 26893238 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6893238, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8294400).
6893238 is an abundant number, since it is smaller than the sum of its proper divisors (9695562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6893238 is a wasteful number, since it uses less digits than its factorization.
6893238 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297.
The product of its digits is 62208, while the sum is 39.
The square root of 6893238 is about 2625.4976671100. The cubic root of 6893238 is about 190.3156157799.
The spelling of 6893238 in words is "six million, eight hundred ninety-three thousand, two hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •