Base | Representation |
---|---|
bin | 1011011000100111… |
… | …1101101010000001 |
3 | 21212222112012021021 |
4 | 2312021331222001 |
5 | 22224323041103 |
6 | 1223130025441 |
7 | 135506060641 |
oct | 26611755201 |
9 | 7788465237 |
10 | 3056065153 |
11 | 1329083a89 |
12 | 713578281 |
13 | 3991b449b |
14 | 20dc3c521 |
15 | 12d46abbd |
hex | b627da81 |
3056065153 has 8 divisors (see below), whose sum is σ = 3173207400. Its totient is φ = 2939707008.
The previous prime is 3056065147. The next prime is 3056065183. The reversal of 3056065153 is 3515606503.
3056065153 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 158180929 + 2897884224 = 12577^2 + 53832^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3056065153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3056065123) 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, 188076 + ... + 203677.
It is an arithmetic number, because the mean of its divisors is an integer number (396650925).
Almost surely, 23056065153 is an apocalyptic number.
It is an amenable number.
3056065153 is a deficient number, since it is larger than the sum of its proper divisors (117142247).
3056065153 is a wasteful number, since it uses less digits than its factorization.
3056065153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 392051.
The product of its (nonzero) digits is 40500, while the sum is 34.
The square root of 3056065153 is about 55281.6891294034. The cubic root of 3056065153 is about 1451.1786141327.
The spelling of 3056065153 in words is "three billion, fifty-six million, sixty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •