Base | Representation |
---|---|
bin | 10111010111011101010000 |
3 | 102112012110101 |
4 | 113113131100 |
5 | 3032003032 |
6 | 335142144 |
7 | 103031200 |
oct | 27273520 |
9 | 12465411 |
10 | 6125392 |
11 | 3504109 |
12 | 2074954 |
13 | 13660c0 |
14 | b56400 |
15 | 80ede7 |
hex | 5d7750 |
6125392 has 60 divisors (see below), whose sum is σ = 14892276. Its totient is φ = 2419200.
The previous prime is 6125381. The next prime is 6125417. The reversal of 6125392 is 2935216.
It can be written as a sum of positive squares in 2 ways, for example, as 3013696 + 3111696 = 1736^2 + 1764^2 .
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 6125392.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 9892 + ... + 10492.
Almost surely, 26125392 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 6125392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7446138).
6125392 is an abundant number, since it is smaller than the sum of its proper divisors (8766884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6125392 is a wasteful number, since it uses less digits than its factorization.
6125392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 636 (or 623 counting only the distinct ones).
The product of its digits is 3240, while the sum is 28.
The square root of 6125392 is about 2474.9529288453. The cubic root of 6125392 is about 182.9691886773.
The spelling of 6125392 in words is "six million, one hundred twenty-five thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •