Base | Representation |
---|---|
bin | 111100111111010000… |
… | …1000100010111110000 |
3 | 110112001122012111020110 |
4 | 1321332201010113300 |
5 | 4121212213214002 |
6 | 140100104141320 |
7 | 12314412242154 |
oct | 1717641042760 |
9 | 415048174213 |
10 | 130971616752 |
11 | 505aa077189 |
12 | 21472167840 |
13 | c4732848a2 |
14 | 64a6549064 |
15 | 36182d9e6c |
hex | 1e7e8445f0 |
130971616752 has 40 divisors (see below), whose sum is σ = 338356379520. Its totient is φ = 43655523520.
The previous prime is 130971616729. The next prime is 130971616777. The reversal of 130971616752 is 257616179031.
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 pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2211949 + ... + 2270387.
It is an arithmetic number, because the mean of its divisors is an integer number (8458909488).
Almost surely, 2130971616752 is an apocalyptic number.
130971616752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130971616752 is an abundant number, since it is smaller than the sum of its proper divisors (207384762768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130971616752 is a wasteful number, since it uses less digits than its factorization.
130971616752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105141 (or 105135 counting only the distinct ones).
The product of its (nonzero) digits is 476280, while the sum is 48.
The spelling of 130971616752 in words is "one hundred thirty billion, nine hundred seventy-one million, six hundred sixteen thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •