Base | Representation |
---|---|
bin | 1100100001110101… |
… | …0100110011101101 |
3 | 22200101022201212210 |
4 | 3020131110303231 |
5 | 23341430134410 |
6 | 1313415321033 |
7 | 146225065332 |
oct | 31035246355 |
9 | 8611281783 |
10 | 3363130605 |
11 | 147644388a |
12 | 79a380179 |
13 | 4179b7213 |
14 | 23c930989 |
15 | 14a3c3220 |
hex | c8754ced |
3363130605 has 8 divisors (see below), whose sum is σ = 5381008992. Its totient is φ = 1793669648.
The previous prime is 3363130601. The next prime is 3363130681. The reversal of 3363130605 is 5060313633.
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 3363130605 - 22 = 3363130601 is a prime.
It is a super-2 number, since 2×33631306052 = 22621294932575332050, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3363130601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 112104339 + ... + 112104368.
It is an arithmetic number, because the mean of its divisors is an integer number (672626124).
Almost surely, 23363130605 is an apocalyptic number.
It is an amenable number.
3363130605 is a deficient number, since it is larger than the sum of its proper divisors (2017878387).
3363130605 is a wasteful number, since it uses less digits than its factorization.
3363130605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224208715.
The product of its (nonzero) digits is 14580, while the sum is 30.
The square root of 3363130605 is about 57992.5047312151. The cubic root of 3363130605 is about 1498.2395056927.
The spelling of 3363130605 in words is "three billion, three hundred sixty-three million, one hundred thirty thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •