Base | Representation |
---|---|
bin | 1100101111111… |
… | …11010100100011 |
3 | 21110020201112010 |
4 | 12113333110203 |
5 | 204334430341 |
6 | 14340204003 |
7 | 2436035220 |
oct | 627772443 |
9 | 243221463 |
10 | 106951971 |
11 | 5540a665 |
12 | 2b999603 |
13 | 19208bb9 |
14 | 102c0947 |
15 | 95c9716 |
hex | 65ff523 |
106951971 has 32 divisors (see below), whose sum is σ = 171417600. Its totient is φ = 58020480.
The previous prime is 106951951. The next prime is 106952003. The reversal of 106951971 is 179159601.
It is not a de Polignac number, because 106951971 - 25 = 106951939 is a prime.
It is a super-2 number, since 2×1069519712 = 22877448201569682, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106951921) 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 31 ways as a sum of consecutive naturals, for example, 35710 + ... + 38588.
It is an arithmetic number, because the mean of its divisors is an integer number (5356800).
Almost surely, 2106951971 is an apocalyptic number.
106951971 is a deficient number, since it is larger than the sum of its proper divisors (64465629).
106951971 is a wasteful number, since it uses less digits than its factorization.
106951971 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2979.
The product of its (nonzero) digits is 17010, while the sum is 39.
The square root of 106951971 is about 10341.7586028683. The cubic root of 106951971 is about 474.6748962846.
The spelling of 106951971 in words is "one hundred six million, nine hundred fifty-one thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •