Base | Representation |
---|---|
bin | 100100010011001… |
… | …001101001111101 |
3 | 1120102221102000211 |
4 | 210103021221331 |
5 | 2221401000221 |
6 | 140232552421 |
7 | 21043262245 |
oct | 4423115175 |
9 | 1512842024 |
10 | 609000061 |
11 | 29284583a |
12 | 14bb52711 |
13 | 9922a287 |
14 | 5ac4ab25 |
15 | 386e96e1 |
hex | 244c9a7d |
609000061 has 8 divisors (see below), whose sum is σ = 646626240. Its totient is φ = 571574208.
The previous prime is 609000037. The next prime is 609000071. The reversal of 609000061 is 160000906.
609000061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 609000061 - 27 = 608999933 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 608999996 and 609000041.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (609000001) 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, 43791 + ... + 55996.
It is an arithmetic number, because the mean of its divisors is an integer number (80828280).
Almost surely, 2609000061 is an apocalyptic number.
It is an amenable number.
609000061 is a deficient number, since it is larger than the sum of its proper divisors (37626179).
609000061 is a wasteful number, since it uses less digits than its factorization.
609000061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100163.
The product of its (nonzero) digits is 324, while the sum is 22.
The square root of 609000061 is about 24677.9265944285. The cubic root of 609000061 is about 847.6289450894.
Adding to 609000061 its reverse (160000906), we get a palindrome (769000967).
The spelling of 609000061 in words is "six hundred nine million, sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •