Base | Representation |
---|---|
bin | 111100100110001… |
… | …101101110100101 |
3 | 2121212000012112012 |
4 | 330212031232211 |
5 | 4040230310121 |
6 | 244514204005 |
7 | 34123250045 |
oct | 7446155645 |
9 | 2555005465 |
10 | 1016650661 |
11 | 481966764 |
12 | 244583605 |
13 | 132819c50 |
14 | 99043725 |
15 | 5e3bec5b |
hex | 3c98dba5 |
1016650661 has 4 divisors (see below), whose sum is σ = 1094854572. Its totient is φ = 938446752.
The previous prime is 1016650631. The next prime is 1016650681. The reversal of 1016650661 is 1660566101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 501088225 + 515562436 = 22385^2 + 22706^2 .
It is a cyclic number.
It is not a de Polignac number, because 1016650661 - 210 = 1016649637 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1016650631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39101936 + ... + 39101961.
It is an arithmetic number, because the mean of its divisors is an integer number (273713643).
Almost surely, 21016650661 is an apocalyptic number.
It is an amenable number.
1016650661 is a deficient number, since it is larger than the sum of its proper divisors (78203911).
1016650661 is an equidigital number, since it uses as much as digits as its factorization.
1016650661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78203910.
The product of its (nonzero) digits is 6480, while the sum is 32.
The square root of 1016650661 is about 31884.9597929808. The cubic root of 1016650661 is about 1005.5196972196.
The spelling of 1016650661 in words is "one billion, sixteen million, six hundred fifty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •