Base | Representation |
---|---|
bin | 111100101000010010… |
… | …1111110101000000000 |
3 | 110110001221102211021220 |
4 | 1321100211332220000 |
5 | 4113122443331000 |
6 | 135451422315040 |
7 | 12256335350223 |
oct | 1712045765000 |
9 | 413057384256 |
10 | 130201152000 |
11 | 50244179657 |
12 | 21298128a80 |
13 | c37c77329a |
14 | 64320ab5ba |
15 | 35c08491a0 |
hex | 1e5097ea00 |
130201152000 has 320 divisors, whose sum is σ = 434120214528. Its totient is φ = 34621440000.
The previous prime is 130201151959. The next prime is 130201152023. The reversal of 130201152000 is 251102031.
It is a tau number, because it is divible by the number of its divisors (320).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 88511265 + ... + 88512735.
Almost surely, 2130201152000 is an apocalyptic number.
130201152000 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 130201152000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (217060107264).
130201152000 is an abundant number, since it is smaller than the sum of its proper divisors (303919062528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130201152000 is an equidigital number, since it uses as much as digits as its factorization.
130201152000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1968 (or 1942 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 130201152000 its reverse (251102031), we get a palindrome (130452254031).
The spelling of 130201152000 in words is "one hundred thirty billion, two hundred one million, one hundred fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •