Base | Representation |
---|---|
bin | 100100001000000… |
… | …111000000000001 |
3 | 1120020111100120121 |
4 | 210020013000001 |
5 | 2220130334401 |
6 | 140050540241 |
7 | 21006545503 |
oct | 4410070001 |
9 | 1506440517 |
10 | 606105601 |
11 | 291149122 |
12 | 14ab97681 |
13 | 9875598a |
14 | 5a6d5d73 |
15 | 38326ca1 |
hex | 24207001 |
606105601 has 4 divisors (see below), whose sum is σ = 608620804. Its totient is φ = 603590400.
The previous prime is 606105593. The next prime is 606105613. The reversal of 606105601 is 106501606.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 106501606 = 2 ⋅53250803.
It can be written as a sum of positive squares in 2 ways, for example, as 275593201 + 330512400 = 16601^2 + 18180^2 .
It is a cyclic number.
It is not a de Polignac number, because 606105601 - 23 = 606105593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (606105001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1257240 + ... + 1257721.
It is an arithmetic number, because the mean of its divisors is an integer number (152155201).
Almost surely, 2606105601 is an apocalyptic number.
It is an amenable number.
606105601 is a deficient number, since it is larger than the sum of its proper divisors (2515203).
606105601 is a wasteful number, since it uses less digits than its factorization.
606105601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2515202.
The product of its (nonzero) digits is 1080, while the sum is 25.
The square root of 606105601 is about 24619.2120304448. The cubic root of 606105601 is about 846.2839396070.
The spelling of 606105601 in words is "six hundred six million, one hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •