Base | Representation |
---|---|
bin | 111100111100001110… |
… | …1100000011110100000 |
3 | 110111210120000211200210 |
4 | 1321320131200132200 |
5 | 4121010211120000 |
6 | 140042034414120 |
7 | 12312036546546 |
oct | 1717035403640 |
9 | 414716024623 |
10 | 130870020000 |
11 | 50557795025 |
12 | 21444131340 |
13 | c458202375 |
14 | 6496c5dd96 |
15 | 360e41c350 |
hex | 1e787607a0 |
130870020000 has 240 divisors, whose sum is σ = 435174949440. Its totient is φ = 34419456000.
The previous prime is 130870019999. The next prime is 130870020031. The reversal of 130870020000 is 20078031.
It is a tau number, because it is divible by the number of its divisors (240).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 4365061 + ... + 4394939.
It is an arithmetic number, because the mean of its divisors is an integer number (1813228956).
Almost surely, 2130870020000 is an apocalyptic number.
130870020000 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 130870020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (217587474720).
130870020000 is an abundant number, since it is smaller than the sum of its proper divisors (304304929440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130870020000 is an equidigital number, since it uses as much as digits as its factorization.
130870020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29985 (or 29962 counting only the distinct ones).
The product of its (nonzero) digits is 336, while the sum is 21.
Adding to 130870020000 its reverse (20078031), we get a palindrome (130890098031).
The spelling of 130870020000 in words is "one hundred thirty billion, eight hundred seventy million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •