Base | Representation |
---|---|
bin | 1110000001101001… |
… | …1111011111110101 |
3 | 100201101120220111012 |
4 | 3200122133133311 |
5 | 30202322304031 |
6 | 1421333522005 |
7 | 162205215221 |
oct | 34032373765 |
9 | 10641526435 |
10 | 3765041141 |
11 | 16622a4154 |
12 | 890aa3305 |
13 | 4800472c4 |
14 | 27a071781 |
15 | 170812b2b |
hex | e069f7f5 |
3765041141 has 8 divisors (see below), whose sum is σ = 3779638200. Its totient is φ = 3750470080.
The previous prime is 3765041131. The next prime is 3765041209. The reversal of 3765041141 is 1411405673.
It can be written as a sum of positive squares in 4 ways, for example, as 110355025 + 3654686116 = 10505^2 + 60454^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-3765041141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3765041098 and 3765041107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3765041131) 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, 313475 + ... + 325263.
It is an arithmetic number, because the mean of its divisors is an integer number (472454775).
Almost surely, 23765041141 is an apocalyptic number.
It is an amenable number.
3765041141 is a deficient number, since it is larger than the sum of its proper divisors (14597059).
3765041141 is a wasteful number, since it uses less digits than its factorization.
3765041141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12999.
The product of its (nonzero) digits is 10080, while the sum is 32.
The square root of 3765041141 is about 61359.9310706914. The cubic root of 3765041141 is about 1555.6906518702.
The spelling of 3765041141 in words is "three billion, seven hundred sixty-five million, forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •