Base | Representation |
---|---|
bin | 1100100010101… |
… | …11101010001010 |
3 | 21022222120002222 |
4 | 12101113222022 |
5 | 203413413100 |
6 | 14235054042 |
7 | 2415220040 |
oct | 621275212 |
9 | 238876088 |
10 | 105216650 |
11 | 54434910 |
12 | 2b2a1322 |
13 | 18a4c096 |
14 | dd8c390 |
15 | 9385485 |
hex | 6457a8a |
105216650 has 48 divisors (see below), whose sum is σ = 244002240. Its totient is φ = 32793600.
The previous prime is 105216637. The next prime is 105216659. The reversal of 105216650 is 56612501.
It is a super-2 number, since 2×1052166502 = 22141086874445000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105216659) 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 23 ways as a sum of consecutive naturals, for example, 9815 + ... + 17514.
It is an arithmetic number, because the mean of its divisors is an integer number (5083380).
Almost surely, 2105216650 is an apocalyptic number.
105216650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105216650 is an abundant number, since it is smaller than the sum of its proper divisors (138785590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105216650 is a wasteful number, since it uses less digits than its factorization.
105216650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27359 (or 27354 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 105216650 is about 10257.5167560185. The cubic root of 105216650 is about 472.0936476303.
It can be divided in two parts, 10521 and 6650, that added together give a palindrome (17171).
The spelling of 105216650 in words is "one hundred five million, two hundred sixteen thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •