Base | Representation |
---|---|
bin | 10111010011100101000010 |
3 | 102111101200000 |
4 | 113103211002 |
5 | 3031001011 |
6 | 334540430 |
7 | 102633654 |
oct | 27234502 |
9 | 12441600 |
10 | 6109506 |
11 | 34a3187 |
12 | 2067716 |
13 | 135bac0 |
14 | b506d4 |
15 | 80a356 |
hex | 5d3942 |
6109506 has 48 divisors (see below), whose sum is σ = 14798784. Its totient is φ = 1877904.
The previous prime is 6109501. The next prime is 6109567. The reversal of 6109506 is 6059016.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 6109506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6109501) 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 23 ways as a sum of consecutive naturals, for example, 5835 + ... + 6801.
It is an arithmetic number, because the mean of its divisors is an integer number (308308).
Almost surely, 26109506 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6109506, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7399392).
6109506 is an abundant number, since it is smaller than the sum of its proper divisors (8689278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6109506 is a wasteful number, since it uses less digits than its factorization.
6109506 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 997 (or 985 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 6109506 is about 2471.7414913376. The cubic root of 6109506 is about 182.8108769087.
The spelling of 6109506 in words is "six million, one hundred nine thousand, five hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •