Base | Representation |
---|---|
bin | 1011011001101011… |
… | …1110101010101101 |
3 | 21220021220211001020 |
4 | 2312122332222231 |
5 | 22231443310431 |
6 | 1223405404353 |
7 | 135562016400 |
oct | 26632765255 |
9 | 7807824036 |
10 | 3060525741 |
11 | 1330650319 |
12 | 714b696b9 |
13 | 39a0b68a0 |
14 | 21067dd37 |
15 | 12da4c696 |
hex | b66beaad |
3060525741 has 48 divisors (see below), whose sum is σ = 5120172288. Its totient is φ = 1611792000.
The previous prime is 3060525739. The next prime is 3060525749. The reversal of 3060525741 is 1475250603.
It is not a de Polignac number, because 3060525741 - 21 = 3060525739 is a prime.
It is a super-3 number, since 3×30605257413 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3060525749) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2351791 + ... + 2353091.
It is an arithmetic number, because the mean of its divisors is an integer number (106670256).
Almost surely, 23060525741 is an apocalyptic number.
It is an amenable number.
3060525741 is a deficient number, since it is larger than the sum of its proper divisors (2059646547).
3060525741 is a wasteful number, since it uses less digits than its factorization.
3060525741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2562 (or 2555 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 33.
The square root of 3060525741 is about 55322.0185911541. The cubic root of 3060525741 is about 1451.8843105960.
The spelling of 3060525741 in words is "three billion, sixty million, five hundred twenty-five thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •