Base | Representation |
---|---|
bin | 1011011011000111… |
… | …1111111011010101 |
3 | 21220201021101210012 |
4 | 2312301333323111 |
5 | 22240014411323 |
6 | 1224143010005 |
7 | 135664221533 |
oct | 26661777325 |
9 | 7821241705 |
10 | 3066560213 |
11 | 1333aa2092 |
12 | 716b99905 |
13 | 39b41a492 |
14 | 2113b1153 |
15 | 12e340678 |
hex | b6c7fed5 |
3066560213 has 8 divisors (see below), whose sum is σ = 3094986456. Its totient is φ = 3038156800.
The previous prime is 3066560197. The next prime is 3066560257. The reversal of 3066560213 is 3120656603.
It can be written as a sum of positive squares in 4 ways, for example, as 89548369 + 2977011844 = 9463^2 + 54562^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 3066560213 - 24 = 3066560197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3066560213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3066560293) 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, 387173 + ... + 395013.
It is an arithmetic number, because the mean of its divisors is an integer number (386873307).
Almost surely, 23066560213 is an apocalyptic number.
It is an amenable number.
3066560213 is a deficient number, since it is larger than the sum of its proper divisors (28426243).
3066560213 is a wasteful number, since it uses less digits than its factorization.
3066560213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11415.
The product of its (nonzero) digits is 19440, while the sum is 32.
The square root of 3066560213 is about 55376.5312474517. The cubic root of 3066560213 is about 1452.8379161716.
The spelling of 3066560213 in words is "three billion, sixty-six million, five hundred sixty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •