Base | Representation |
---|---|
bin | 1011010111001100… |
… | …0001110010010101 |
3 | 21212120012201210221 |
4 | 2311303001302111 |
5 | 22221303142012 |
6 | 1222353114341 |
7 | 135404010043 |
oct | 26563016225 |
9 | 7776181727 |
10 | 3050052757 |
11 | 1325747864 |
12 | 7115589b1 |
13 | 397b8a95b |
14 | 20d115393 |
15 | 12cb7e507 |
hex | b5cc1c95 |
3050052757 has 8 divisors (see below), whose sum is σ = 3158105400. Its totient is φ = 2942192064.
The previous prime is 3050052751. The next prime is 3050052787. The reversal of 3050052757 is 7572500503.
3050052757 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 6765201 + 3043287556 = 2601^2 + 55166^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3050052757 - 211 = 3050050709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3050052751) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15258 + ... + 79579.
It is an arithmetic number, because the mean of its divisors is an integer number (394763175).
Almost surely, 23050052757 is an apocalyptic number.
It is an amenable number.
3050052757 is a deficient number, since it is larger than the sum of its proper divisors (108052643).
3050052757 is a wasteful number, since it uses less digits than its factorization.
3050052757 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95975.
The product of its (nonzero) digits is 36750, while the sum is 34.
The square root of 3050052757 is about 55227.2827233062. The cubic root of 3050052757 is about 1450.2263232932.
The spelling of 3050052757 in words is "three billion, fifty million, fifty-two thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •