Base | Representation |
---|---|
bin | 111100111000001110… |
… | …0111000010100000000 |
3 | 110111110012011111220210 |
4 | 1321300130320110000 |
5 | 4120221310402020 |
6 | 140020434234120 |
7 | 12305515404600 |
oct | 1716034702400 |
9 | 414405144823 |
10 | 130735637760 |
11 | 5049894a722 |
12 | 21407125940 |
13 | c436411050 |
14 | 648307cc00 |
15 | 36027253e0 |
hex | 1e70738500 |
130735637760 has 1728 divisors, whose sum is σ = 575456313600. Its totient is φ = 24970788864.
The previous prime is 130735637723. The next prime is 130735637771. The reversal of 130735637760 is 67736537031.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 1347790032 + ... + 1347790128.
It is an arithmetic number, because the mean of its divisors is an integer number (333018700).
Almost surely, 2130735637760 is an apocalyptic number.
130735637760 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 130735637760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (287728156800).
130735637760 is an abundant number, since it is smaller than the sum of its proper divisors (444720675840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130735637760 is a wasteful number, since it uses less digits than its factorization.
130735637760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196 (or 175 counting only the distinct ones).
The product of its (nonzero) digits is 1666980, while the sum is 48.
The spelling of 130735637760 in words is "one hundred thirty billion, seven hundred thirty-five million, six hundred thirty-seven thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •