Base | Representation |
---|---|
bin | 1101101001110100… |
… | …0101010101010001 |
3 | 100110102110012011202 |
4 | 3122131011111101 |
5 | 30001223311410 |
6 | 1403402520545 |
7 | 156552320453 |
oct | 33235052521 |
9 | 10412405152 |
10 | 3665057105 |
11 | 1610913716 |
12 | 863506155 |
13 | 46540ab58 |
14 | 26aa862d3 |
15 | 166b62ca5 |
hex | da745551 |
3665057105 has 8 divisors (see below), whose sum is σ = 4399238952. Its totient is φ = 2931265408.
The previous prime is 3665057101. The next prime is 3665057111. The reversal of 3665057105 is 5017505663.
3665057105 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 539911696 + 3125145409 = 23236^2 + 55903^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 3665057105 - 22 = 3665057101 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3665057101) 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, 76454 + ... + 114783.
It is an arithmetic number, because the mean of its divisors is an integer number (549904869).
Almost surely, 23665057105 is an apocalyptic number.
It is an amenable number.
3665057105 is a deficient number, since it is larger than the sum of its proper divisors (734181847).
3665057105 is a wasteful number, since it uses less digits than its factorization.
3665057105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 195075.
The product of its (nonzero) digits is 94500, while the sum is 38.
The square root of 3665057105 is about 60539.7151050449. The cubic root of 3665057105 is about 1541.7960022521.
The spelling of 3665057105 in words is "three billion, six hundred sixty-five million, fifty-seven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •