Base | Representation |
---|---|
bin | 111100110101110010… |
… | …0000011010001110000 |
3 | 110111020110212011121121 |
4 | 1321223210003101300 |
5 | 4120034312202400 |
6 | 140004344432024 |
7 | 12303501354562 |
oct | 1715344032160 |
9 | 414213764547 |
10 | 130653631600 |
11 | 50456629238 |
12 | 213a3778614 |
13 | c42242a7ab |
14 | 6476213332 |
15 | 35ea42721a |
hex | 1e6b903470 |
130653631600 has 120 divisors (see below), whose sum is σ = 315787859712. Its totient is φ = 51947212800.
The previous prime is 130653631573. The next prime is 130653631723. The reversal of 130653631600 is 6136356031.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 88818865 + ... + 88820335.
Almost surely, 2130653631600 is an apocalyptic number.
130653631600 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 130653631600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157893929856).
130653631600 is an abundant number, since it is smaller than the sum of its proper divisors (185134228112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130653631600 is a wasteful number, since it uses less digits than its factorization.
130653631600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2675 (or 2664 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 34.
Adding to 130653631600 its reverse (6136356031), we get a palindrome (136789987631).
The spelling of 130653631600 in words is "one hundred thirty billion, six hundred fifty-three million, six hundred thirty-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •