Base | Representation |
---|---|
bin | 1011010110000101… |
… | …00101001101000000 |
3 | 120201110221000012101 |
4 | 11223002211031000 |
5 | 44433221243310 |
6 | 2444215040144 |
7 | 303635666062 |
oct | 55302451500 |
9 | 16643830171 |
10 | 6090806080 |
11 | 2646112837 |
12 | 121b970054 |
13 | 760b40888 |
14 | 41acc9732 |
15 | 259ac343a |
hex | 16b0a5340 |
6090806080 has 56 divisors (see below), whose sum is σ = 14741545320. Its totient is φ = 2396375040.
The previous prime is 6090806077. The next prime is 6090806083. The reversal of 6090806080 is 806080906.
It is an interprime number because it is at equal distance from previous prime (6090806077) and next prime (6090806083).
It can be written as a sum of positive squares in 4 ways, for example, as 10549504 + 6080256576 = 3248^2 + 77976^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6090806083) 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 7 ways as a sum of consecutive naturals, for example, 136495 + ... + 175534.
Almost surely, 26090806080 is an apocalyptic number.
It is an amenable number.
6090806080 is an abundant number, since it is smaller than the sum of its proper divisors (8650739240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6090806080 is a wasteful number, since it uses less digits than its factorization.
6090806080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312107 (or 312097 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 37.
The square root of 6090806080 is about 78043.6165230700. The cubic root of 6090806080 is about 1826.2417100385.
Adding to 6090806080 its reverse (806080906), we get a palindrome (6896886986).
The spelling of 6090806080 in words is "six billion, ninety million, eight hundred six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •