Base | Representation |
---|---|
bin | 1100100111010… |
… | …01010010101010 |
3 | 21101002212101000 |
4 | 12103221102222 |
5 | 204042010122 |
6 | 14255535430 |
7 | 2423253120 |
oct | 623512252 |
9 | 241085330 |
10 | 105813162 |
11 | 54801aa4 |
12 | 2b52a576 |
13 | 18bca750 |
14 | 100a5910 |
15 | 94520ac |
hex | 64e94aa |
105813162 has 128 divisors (see below), whose sum is σ = 294981120. Its totient is φ = 27371520.
The previous prime is 105813157. The next prime is 105813181. The reversal of 105813162 is 261318501.
It is a super-2 number, since 2×1058131622 = 22392850504876488, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 299578 + ... + 299930.
It is an arithmetic number, because the mean of its divisors is an integer number (2304540).
Almost surely, 2105813162 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105813162, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147490560).
105813162 is an abundant number, since it is smaller than the sum of its proper divisors (189167958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105813162 is a wasteful number, since it uses less digits than its factorization.
105813162 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 445 (or 439 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 105813162 is about 10286.5524837041. The cubic root of 105813162 is about 472.9841246067.
The spelling of 105813162 in words is "one hundred five million, eight hundred thirteen thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •