Base | Representation |
---|---|
bin | 1111100001000… |
… | …01011001001000 |
3 | 100001220211020011 |
4 | 13300201121020 |
5 | 231310111300 |
6 | 20525441304 |
7 | 3140225542 |
oct | 760413110 |
9 | 301824204 |
10 | 130160200 |
11 | 67521315 |
12 | 37710234 |
13 | 20c73691 |
14 | 13402692 |
15 | b660eba |
hex | 7c21648 |
130160200 has 48 divisors (see below), whose sum is σ = 303724980. Its totient is φ = 51874560.
The previous prime is 130160179. The next prime is 130160273. The reversal of 130160200 is 2061031.
It can be written as a sum of positive squares in 6 ways, for example, as 17757796 + 112402404 = 4214^2 + 10602^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 62374 + ... + 64426.
Almost surely, 2130160200 is an apocalyptic number.
130160200 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 130160200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151862490).
130160200 is an abundant number, since it is smaller than the sum of its proper divisors (173564780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130160200 is a wasteful number, since it uses less digits than its factorization.
130160200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2386 (or 2377 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 130160200 is about 11408.7773227459. Note that the first 3 decimals coincide. The cubic root of 130160200 is about 506.7877038472.
The spelling of 130160200 in words is "one hundred thirty million, one hundred sixty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •