Base | Representation |
---|---|
bin | 1110000001101001… |
… | …1100111001010101 |
3 | 100201101120100212112 |
4 | 3200122130321111 |
5 | 30202321433420 |
6 | 1421333400405 |
7 | 162205142156 |
oct | 34032347125 |
9 | 10641510775 |
10 | 3765030485 |
11 | 1662297147 |
12 | 890a99105 |
13 | 4800424b8 |
14 | 27a06b92d |
15 | 17080e8c5 |
hex | e069ce55 |
3765030485 has 8 divisors (see below), whose sum is σ = 4534116696. Its totient is φ = 3001304320.
The previous prime is 3765030469. The next prime is 3765030487. The reversal of 3765030485 is 5840305673.
3765030485 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 488498404 + 3276532081 = 22102^2 + 57241^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3765030485 - 24 = 3765030469 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 (3765030487) 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, 1338464 + ... + 1341273.
It is an arithmetic number, because the mean of its divisors is an integer number (566764587).
Almost surely, 23765030485 is an apocalyptic number.
It is an amenable number.
3765030485 is a deficient number, since it is larger than the sum of its proper divisors (769086211).
3765030485 is a wasteful number, since it uses less digits than its factorization.
3765030485 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2680023.
The product of its (nonzero) digits is 302400, while the sum is 41.
The square root of 3765030485 is about 61359.8442387202. The cubic root of 3765030485 is about 1555.6891842054.
The spelling of 3765030485 in words is "three billion, seven hundred sixty-five million, thirty thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •