Base | Representation |
---|---|
bin | 1100001010100001… |
… | …11011101000111000 |
3 | 121212010210202221002 |
4 | 12011100323220320 |
5 | 101333334304413 |
6 | 3000013104132 |
7 | 320560451060 |
oct | 60520735070 |
9 | 17763722832 |
10 | 6530775608 |
11 | 28514a8415 |
12 | 1323188048 |
13 | 801037b86 |
14 | 45d4d63a0 |
15 | 28352e958 |
hex | 18543ba38 |
6530775608 has 64 divisors (see below), whose sum is σ = 14980896000. Its totient is φ = 2606625792.
The previous prime is 6530775599. The next prime is 6530775617. The reversal of 6530775608 is 8065770356.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (6530775599) and next prime (6530775617).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10760 + ... + 114792.
It is an arithmetic number, because the mean of its divisors is an integer number (234076500).
Almost surely, 26530775608 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 6530775608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7490448000).
6530775608 is an abundant number, since it is smaller than the sum of its proper divisors (8450120392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6530775608 is a wasteful number, since it uses less digits than its factorization.
6530775608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104124 (or 104120 counting only the distinct ones).
The product of its (nonzero) digits is 1058400, while the sum is 47.
The square root of 6530775608 is about 80813.2143154818. The cubic root of 6530775608 is about 1869.1963343858.
The spelling of 6530775608 in words is "six billion, five hundred thirty million, seven hundred seventy-five thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •