Base | Representation |
---|---|
bin | 110001011111010… |
… | …0111000100000101 |
3 | 11021201200012122201 |
4 | 1202332213010011 |
5 | 11400102030401 |
6 | 432435554501 |
7 | 56102461255 |
oct | 14276470405 |
9 | 4251605581 |
10 | 1660580101 |
11 | 782399454 |
12 | 3a415ba31 |
13 | 206056a9b |
14 | 11a783965 |
15 | 9abb8b01 |
hex | 62fa7105 |
1660580101 has 2 divisors, whose sum is σ = 1660580102. Its totient is φ = 1660580100.
The previous prime is 1660580099. The next prime is 1660580143. The reversal of 1660580101 is 1010850661.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1349092900 + 311487201 = 36730^2 + 17649^2 .
It is an emirp because it is prime and its reverse (1010850661) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1660580101 - 21 = 1660580099 is a prime.
Together with 1660580099, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1660580101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1660580501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 830290050 + 830290051.
It is an arithmetic number, because the mean of its divisors is an integer number (830290051).
Almost surely, 21660580101 is an apocalyptic number.
It is an amenable number.
1660580101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1660580101 is an equidigital number, since it uses as much as digits as its factorization.
1660580101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 28.
The square root of 1660580101 is about 40750.2159626179. The cubic root of 1660580101 is about 1184.1860566833.
The spelling of 1660580101 in words is "one billion, six hundred sixty million, five hundred eighty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •