Base | Representation |
---|---|
bin | 10111001010101110010000 |
3 | 102102112220112 |
4 | 113022232100 |
5 | 3023320412 |
6 | 334100452 |
7 | 102423134 |
oct | 27125620 |
9 | 12375815 |
10 | 6073232 |
11 | 3478a00 |
12 | 204a728 |
13 | 1348439 |
14 | b413c4 |
15 | 7ee722 |
hex | 5cab90 |
6073232 has 30 divisors (see below), whose sum is σ = 12937974. Its totient is φ = 2759680.
The previous prime is 6073211. The next prime is 6073237. The reversal of 6073232 is 2323706.
It can be written as a sum of positive squares in only one way, i.e., 6071296 + 1936 = 2464^2 + 44^2 .
It is a junction number, because it is equal to n+sod(n) for n = 6073198 and 6073207.
It is not an unprimeable number, because it can be changed into a prime (6073237) 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 5 ways as a sum of consecutive naturals, for example, 368 + ... + 3504.
Almost surely, 26073232 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 6073232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6468987).
6073232 is an abundant number, since it is smaller than the sum of its proper divisors (6864742).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6073232 is a wasteful number, since it uses less digits than its factorization.
6073232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3167 (or 3150 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 23.
The square root of 6073232 is about 2464.3928258295. The cubic root of 6073232 is about 182.4483571899.
Adding to 6073232 its reverse (2323706), we get a palindrome (8396938).
The spelling of 6073232 in words is "six million, seventy-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •