Base | Representation |
---|---|
bin | 10001100111000110001… |
… | …10101100100110011101 |
3 | 2010211212211221122220111 |
4 | 20303203012230212131 |
5 | 34403224013330041 |
6 | 1141552013050021 |
7 | 61501036530601 |
oct | 10634306544635 |
9 | 2124784848814 |
10 | 605105605021 |
11 | 213695380185 |
12 | 99334786911 |
13 | 450a4642b78 |
14 | 21404395501 |
15 | 10b181d4981 |
hex | 8ce31ac99d |
605105605021 has 8 divisors (see below), whose sum is σ = 619022205560. Its totient is φ = 591341098752.
The previous prime is 605105605009. The next prime is 605105605031. The reversal of 605105605021 is 120506501506.
605105605021 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 65746088100 + 539359516921 = 256410^2 + 734411^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 605105605021 - 27 = 605105604893 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 (605105605031) 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, 38015520 + ... + 38031433.
It is an arithmetic number, because the mean of its divisors is an integer number (77377775695).
Almost surely, 2605105605021 is an apocalyptic number.
It is an amenable number.
605105605021 is a deficient number, since it is larger than the sum of its proper divisors (13916600539).
605105605021 is a wasteful number, since it uses less digits than its factorization.
605105605021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76047135.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 605105605021 in words is "six hundred five billion, one hundred five million, six hundred five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •