Base | Representation |
---|---|
bin | 1011110000001011… |
… | …10011100010110000 |
3 | 121021201220202201201 |
4 | 11320011303202300 |
5 | 100410244130211 |
6 | 2522035540544 |
7 | 312235014223 |
oct | 57005634260 |
9 | 17251822651 |
10 | 6309755056 |
11 | 2748768400 |
12 | 128115a754 |
13 | 797300a97 |
14 | 43c0015ba |
15 | 26de220c1 |
hex | 1781738b0 |
6309755056 has 60 divisors (see below), whose sum is σ = 13456779336. Its totient is φ = 2863970560.
The previous prime is 6309755051. The next prime is 6309755057. The reversal of 6309755056 is 6505579036.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 6309754997 and 6309755015.
It is not an unprimeable number, because it can be changed into a prime (6309755051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1657251 + ... + 1661053.
Almost surely, 26309755056 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 6309755056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6728389668).
6309755056 is an abundant number, since it is smaller than the sum of its proper divisors (7147024280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6309755056 is a wasteful number, since it uses less digits than its factorization.
6309755056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4690 (or 4673 counting only the distinct ones).
The product of its (nonzero) digits is 850500, while the sum is 46.
The square root of 6309755056 is about 79433.9666389637. The cubic root of 6309755056 is about 1847.8675264071.
The spelling of 6309755056 in words is "six billion, three hundred nine million, seven hundred fifty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •