Base | Representation |
---|---|
bin | 1100101110111… |
… | …01001011101101 |
3 | 21102222121201020 |
4 | 12113131023231 |
5 | 204320442031 |
6 | 14333204353 |
7 | 2434613442 |
oct | 627351355 |
9 | 242877636 |
10 | 106812141 |
11 | 553245a7 |
12 | 2b9306b9 |
13 | 1918a367 |
14 | 102859c9 |
15 | 959d096 |
hex | 65dd2ed |
106812141 has 8 divisors (see below), whose sum is σ = 142479264. Its totient is φ = 71176560.
The previous prime is 106812131. The next prime is 106812149. The reversal of 106812141 is 141218601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-106812141 is a prime.
It is a super-2 number, since 2×1068121412 = 22817666930007762, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106812149) 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 7 ways as a sum of consecutive naturals, for example, 1675 + ... + 14711.
It is an arithmetic number, because the mean of its divisors is an integer number (17809908).
Almost surely, 2106812141 is an apocalyptic number.
It is an amenable number.
106812141 is a deficient number, since it is larger than the sum of its proper divisors (35667123).
106812141 is a wasteful number, since it uses less digits than its factorization.
106812141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15771.
The product of its (nonzero) digits is 384, while the sum is 24.
The square root of 106812141 is about 10334.9959361385. The cubic root of 106812141 is about 474.4679412778.
It can be divided in two parts, 106812 and 141, that added together give a triangular number (106953 = T462).
The spelling of 106812141 in words is "one hundred six million, eight hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •