Base | Representation |
---|---|
bin | 10001101000111000000… |
… | …11001111010101111100 |
3 | 2010221100102200202111221 |
4 | 20310130003033111330 |
5 | 34412203104000220 |
6 | 1142230502323124 |
7 | 61533520334065 |
oct | 10643403172574 |
9 | 2127312622457 |
10 | 606061000060 |
11 | 2140356a865a |
12 | 995607294a4 |
13 | 451c7563489 |
14 | 2149521156c |
15 | 10b720049aa |
hex | 8d1c0cf57c |
606061000060 has 24 divisors (see below), whose sum is σ = 1294299765360. Its totient is φ = 238315511424.
The previous prime is 606061000043. The next prime is 606061000067. The reversal of 606061000060 is 60000160606.
606061000060 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 606060999989 and 606061000034.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (606061000067) 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, 256804329 + ... + 256806688.
It is an arithmetic number, because the mean of its divisors is an integer number (53929156890).
Almost surely, 2606061000060 is an apocalyptic number.
It is an amenable number.
606061000060 is an abundant number, since it is smaller than the sum of its proper divisors (688238765300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
606061000060 is a wasteful number, since it uses less digits than its factorization.
606061000060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 513611085 (or 513611083 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 606061000060 its reverse (60000160606), we get a palindrome (666061160666).
The spelling of 606061000060 in words is "six hundred six billion, sixty-one million, sixty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •