Base | Representation |
---|---|
bin | 110001110010010011… |
… | …1100000011011100111 |
3 | 101012222002000101210102 |
4 | 1203210213200123213 |
5 | 3222430140324212 |
6 | 121041014414315 |
7 | 10503306415436 |
oct | 1434447403347 |
9 | 335862011712 |
10 | 106914776807 |
11 | 41384671283 |
12 | 1887966139b |
13 | a10b276a57 |
14 | 526355511d |
15 | 2bab31c5c2 |
hex | 18e49e06e7 |
106914776807 has 8 divisors (see below), whose sum is σ = 107198640000. Its totient is φ = 106631117824.
The previous prime is 106914776797. The next prime is 106914776809. The reversal of 106914776807 is 708677419601.
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 106914776807 - 210 = 106914775783 is a prime.
It is a super-2 number, since 2×1069147768072 (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 (106914776809) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1027523 + ... + 1126779.
It is an arithmetic number, because the mean of its divisors is an integer number (13399830000).
Almost surely, 2106914776807 is an apocalyptic number.
106914776807 is a deficient number, since it is larger than the sum of its proper divisors (283863193).
106914776807 is an equidigital number, since it uses as much as digits as its factorization.
106914776807 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102105.
The product of its (nonzero) digits is 3556224, while the sum is 56.
The spelling of 106914776807 in words is "one hundred six billion, nine hundred fourteen million, seven hundred seventy-six thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •