Base | Representation |
---|---|
bin | 1100010011111010… |
… | …10101101001011110 |
3 | 122001121222200020220 |
4 | 12021331111221132 |
5 | 102014014302332 |
6 | 3011505022210 |
7 | 322535016120 |
oct | 61175255136 |
9 | 18047880226 |
10 | 6609525342 |
11 | 28919a5242 |
12 | 1345624966 |
13 | 81444b154 |
14 | 469b55210 |
15 | 28a3d7d2c |
hex | 189f55a5e |
6609525342 has 16 divisors (see below), whose sum is σ = 15107486592. Its totient is φ = 1888435800.
The previous prime is 6609525337. The next prime is 6609525361. The reversal of 6609525342 is 2435259066.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 157369651 = 6609525342 / (6 + 6 + 0 + 9 + 5 + 2 + 5 + 3 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 6609525294 and 6609525303.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78684784 + ... + 78684867.
It is an arithmetic number, because the mean of its divisors is an integer number (944217912).
Almost surely, 26609525342 is an apocalyptic number.
6609525342 is an abundant number, since it is smaller than the sum of its proper divisors (8497961250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6609525342 is a wasteful number, since it uses less digits than its factorization.
6609525342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157369663.
The product of its (nonzero) digits is 388800, while the sum is 42.
The square root of 6609525342 is about 81298.9873368666. The cubic root of 6609525342 is about 1876.6794166317.
The spelling of 6609525342 in words is "six billion, six hundred nine million, five hundred twenty-five thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •