Base | Representation |
---|---|
bin | 1100100010101… |
… | …11100001101100 |
3 | 21022222112100220 |
4 | 12101113201230 |
5 | 203413403413 |
6 | 14235051340 |
7 | 2415215334 |
oct | 621274154 |
9 | 238875326 |
10 | 105216108 |
11 | 54434468 |
12 | 2b2a0b50 |
13 | 18a4ba6a |
14 | dd8c0c4 |
15 | 9385223 |
hex | 645786c |
105216108 has 48 divisors (see below), whose sum is σ = 255768576. Its totient is φ = 33626880.
The previous prime is 105216103. The next prime is 105216109. The reversal of 105216108 is 801612501.
It is a super-2 number, since 2×1052161082 = 22140858765335328, which contains 22 as substring.
It is a hoax number, since the sum of its digits (24) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (105216101) 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, 40785 + ... + 43287.
It is an arithmetic number, because the mean of its divisors is an integer number (5328512).
Almost surely, 2105216108 is an apocalyptic number.
It is an amenable number.
105216108 is an abundant number, since it is smaller than the sum of its proper divisors (150552468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105216108 is a wasteful number, since it uses less digits than its factorization.
105216108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2654 (or 2652 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 24.
The square root of 105216108 is about 10257.4903363347. The cubic root of 105216108 is about 472.0928370007.
Adding to 105216108 its reverse (801612501), we get a palindrome (906828609).
The spelling of 105216108 in words is "one hundred five million, two hundred sixteen thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •