Base | Representation |
---|---|
bin | 111100100110001111… |
… | …1001000110000000000 |
3 | 110102220010210012222011 |
4 | 1321030133020300000 |
5 | 4113002323441400 |
6 | 135440521422304 |
7 | 12254540604463 |
oct | 1711437106000 |
9 | 412803705864 |
10 | 130132249600 |
11 | 50209298221 |
12 | 2127903a994 |
13 | c36b3ca232 |
14 | 6426c932da |
15 | 35b97888ba |
hex | 1e4c7c8c00 |
130132249600 has 132 divisors (see below), whose sum is σ = 323935293600. Its totient is φ = 51832668160.
The previous prime is 130132249567. The next prime is 130132249601. The reversal of 130132249600 is 6942231031.
130132249600 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (130132249601) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6107766 + ... + 6129034.
Almost surely, 2130132249600 is an apocalyptic number.
130132249600 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 130132249600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161967646800).
130132249600 is an abundant number, since it is smaller than the sum of its proper divisors (193803044000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130132249600 is a wasteful number, since it uses less digits than its factorization.
130132249600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21538 (or 21515 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 31.
The spelling of 130132249600 in words is "one hundred thirty billion, one hundred thirty-two million, two hundred forty-nine thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •