Base | Representation |
---|---|
bin | 1100101011001… |
… | …00000110000000 |
3 | 21102001102100120 |
4 | 12111210012000 |
5 | 204204104120 |
6 | 14314420240 |
7 | 2430446436 |
oct | 625440600 |
9 | 242042316 |
10 | 106316160 |
11 | 550159a5 |
12 | 2b731680 |
13 | 19045692 |
14 | 10196d56 |
15 | 9501140 |
hex | 6564180 |
106316160 has 64 divisors (see below), whose sum is σ = 338888880. Its totient is φ = 28350464.
The previous prime is 106316159. The next prime is 106316183. The reversal of 106316160 is 61613601.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×1063161602 = 22606251754291200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 106316160.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25767 + ... + 29606.
Almost surely, 2106316160 is an apocalyptic number.
106316160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106316160 is an abundant number, since it is smaller than the sum of its proper divisors (232572720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106316160 is an equidigital number, since it uses as much as digits as its factorization.
106316160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55395 (or 55383 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
The square root of 106316160 is about 10310.9727960072. The cubic root of 106316160 is about 473.7324060643.
Adding to 106316160 its reverse (61613601), we get a palindrome (167929761).
The spelling of 106316160 in words is "one hundred six million, three hundred sixteen thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •