Base | Representation |
---|---|
bin | 100110010110… |
… | …0101110110000 |
3 | 1101211111110121 |
4 | 1030230232300 |
5 | 20121344120 |
6 | 1554540024 |
7 | 332620354 |
oct | 114545660 |
9 | 41744417 |
10 | 20106160 |
11 | 10393068 |
12 | 6897614 |
13 | 421c849 |
14 | 2955464 |
15 | 1b725aa |
hex | 132cbb0 |
20106160 has 40 divisors (see below), whose sum is σ = 47246976. Its totient is φ = 7956480.
The previous prime is 20106157. The next prime is 20106167. The reversal of 20106160 is 6160102.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (20106167) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6465 + ... + 9055.
Almost surely, 220106160 is an apocalyptic number.
20106160 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20106160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23623488).
20106160 is an abundant number, since it is smaller than the sum of its proper divisors (27140816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20106160 is a wasteful number, since it uses less digits than its factorization.
20106160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2701 (or 2695 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 20106160 is about 4483.9892952593. The cubic root of 20106160 is about 271.9211853541.
Adding to 20106160 its reverse (6160102), we get a palindrome (26266262).
The spelling of 20106160 in words is "twenty million, one hundred six thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •