Base | Representation |
---|---|
bin | 110001101010011010… |
… | …1111010000111110101 |
3 | 101012021122000021020102 |
4 | 1203110311322013311 |
5 | 3221404412212342 |
6 | 120554442043445 |
7 | 10463614014353 |
oct | 1432465720765 |
9 | 335248007212 |
10 | 106650116597 |
11 | 41259235132 |
12 | 18804aa9585 |
13 | a0984a058b |
14 | 523a3407d3 |
15 | 2b92e8e832 |
hex | 18d4d7a1f5 |
106650116597 has 4 divisors (see below), whose sum is σ = 106770899040. Its totient is φ = 106529334156.
The previous prime is 106650116563. The next prime is 106650116621. The reversal of 106650116597 is 795611056601.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 106650116597 - 228 = 106381681141 is a prime.
It is a super-2 number, since 2×1066501165972 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106650113597) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60389897 + ... + 60391662.
It is an arithmetic number, because the mean of its divisors is an integer number (26692724760).
Almost surely, 2106650116597 is an apocalyptic number.
It is an amenable number.
106650116597 is a deficient number, since it is larger than the sum of its proper divisors (120782443).
106650116597 is an equidigital number, since it uses as much as digits as its factorization.
106650116597 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120782442.
The product of its (nonzero) digits is 340200, while the sum is 47.
The spelling of 106650116597 in words is "one hundred six billion, six hundred fifty million, one hundred sixteen thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.232 sec. • engine limits •