Base | Representation |
---|---|
bin | 10011000101101… |
… | …10010000110100 |
3 | 102011022110012110 |
4 | 21202312100310 |
5 | 311443130400 |
6 | 23520051020 |
7 | 3653040414 |
oct | 1142662064 |
9 | 364273173 |
10 | 160130100 |
11 | 82431129 |
12 | 45763a70 |
13 | 27237a50 |
14 | 173a4644 |
15 | e0d0e50 |
hex | 98b6434 |
160130100 has 144 divisors (see below), whose sum is σ = 525452480. Its totient is φ = 37324800.
The previous prime is 160130053. The next prime is 160130107. The reversal of 160130100 is 1031061.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160130107) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 73020 + ... + 75180.
Almost surely, 2160130100 is an apocalyptic number.
160130100 is a gapful number since it is divisible by the number (10) 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 160130100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (262726240).
160130100 is an abundant number, since it is smaller than the sum of its proper divisors (365322380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
160130100 is a wasteful number, since it uses less digits than its factorization.
160130100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2210 (or 2203 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 160130100 is about 12654.2522497380. The cubic root of 160130100 is about 543.0306275098.
Adding to 160130100 its reverse (1031061), we get a palindrome (161161161).
The spelling of 160130100 in words is "one hundred sixty million, one hundred thirty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •