Base | Representation |
---|---|
bin | 111100110101010001… |
… | …1110110000000000000 |
3 | 110111012022012001000000 |
4 | 1321222203312000000 |
5 | 4120021010100000 |
6 | 140002544000000 |
7 | 12303205323060 |
oct | 1715243660000 |
9 | 414168161000 |
10 | 130636800000 |
11 | 50448082423 |
12 | 2139a000000 |
13 | c41bab6575 |
14 | 6473cb13a0 |
15 | 35e8c00000 |
hex | 1e6a8f6000 |
130636800000 has 1176 divisors, whose sum is σ = 559546030512. Its totient is φ = 29859840000.
The previous prime is 130636799947. The next prime is 130636800037. The reversal of 130636800000 is 8636031.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 83 ways as a sum of consecutive naturals, for example, 18662399997 + ... + 18662400003.
Almost surely, 2130636800000 is an apocalyptic number.
130636800000 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 130636800000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (279773015256).
130636800000 is an abundant number, since it is smaller than the sum of its proper divisors (428909230512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130636800000 is an frugal number, since it uses more digits than its factorization.
130636800000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76 (or 17 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The spelling of 130636800000 in words is "one hundred thirty billion, six hundred thirty-six million, eight hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •