Base | Representation |
---|---|
bin | 1100100010010… |
… | …11011100010110 |
3 | 21022220000110210 |
4 | 12101023130112 |
5 | 203410312424 |
6 | 14234030250 |
7 | 2414621130 |
oct | 621133426 |
9 | 238800423 |
10 | 105166614 |
11 | 54400263 |
12 | 2b278386 |
13 | 18a32387 |
14 | dd78050 |
15 | 9375729 |
hex | 644b716 |
105166614 has 32 divisors (see below), whose sum is σ = 242519040. Its totient is φ = 29780352.
The previous prime is 105166609. The next prime is 105166619. The reversal of 105166614 is 416661501.
It is an interprime number because it is at equal distance from previous prime (105166609) and next prime (105166619).
It is a super-2 number, since 2×1051666142 = 22120033400449992, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105166619) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6334 + ... + 15825.
It is an arithmetic number, because the mean of its divisors is an integer number (7578720).
Almost surely, 2105166614 is an apocalyptic number.
105166614 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
105166614 is an abundant number, since it is smaller than the sum of its proper divisors (137352426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105166614 is a wasteful number, since it uses less digits than its factorization.
105166614 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22284.
The product of its (nonzero) digits is 4320, while the sum is 30.
The square root of 105166614 is about 10255.0774741101. The cubic root of 105166614 is about 472.0188007210.
The spelling of 105166614 in words is "one hundred five million, one hundred sixty-six thousand, six hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •