Base | Representation |
---|---|
bin | 110001110100011100… |
… | …1100100101010010111 |
3 | 101020011002012111022100 |
4 | 1203220321210222113 |
5 | 3223102033342331 |
6 | 121052102333143 |
7 | 10505141164443 |
oct | 1435071445227 |
9 | 336132174270 |
10 | 106986621591 |
11 | 41411182333 |
12 | 1889972a1b3 |
13 | a120110165 |
14 | 526ccd7823 |
15 | 2bb27aeae6 |
hex | 18e8e64a97 |
106986621591 has 6 divisors (see below), whose sum is σ = 154536231200. Its totient is φ = 71324414388.
The previous prime is 106986621569. The next prime is 106986621613. The reversal of 106986621591 is 195126689601.
106986621591 is a `hidden beast` number, since 1 + 0 + 6 + 9 + 8 + 6 + 621 + 5 + 9 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (106986621569) and next prime (106986621613).
It is not a de Polignac number, because 106986621591 - 231 = 104839137943 is a prime.
It is a super-2 number, since 2×1069866215912 (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 (106986621541) 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 5 ways as a sum of consecutive naturals, for example, 5943701191 + ... + 5943701208.
Almost surely, 2106986621591 is an apocalyptic number.
106986621591 is a deficient number, since it is larger than the sum of its proper divisors (47549609609).
106986621591 is a wasteful number, since it uses less digits than its factorization.
106986621591 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11887402405 (or 11887402402 counting only the distinct ones).
The product of its (nonzero) digits is 1399680, while the sum is 54.
The spelling of 106986621591 in words is "one hundred six billion, nine hundred eighty-six million, six hundred twenty-one thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •