Base | Representation |
---|---|
bin | 111100110110010110… |
… | …1110100100010000000 |
3 | 110111021211020122201022 |
4 | 1321230231310202000 |
5 | 4120104240013411 |
6 | 140010315125012 |
7 | 12304124626412 |
oct | 1715455644200 |
9 | 414254218638 |
10 | 130672969856 |
11 | 50466537370 |
12 | 213aa143768 |
13 | c42643b950 |
14 | 6478a089b2 |
15 | 35ebe96edb |
hex | 1e6cb74880 |
130672969856 has 256 divisors, whose sum is σ = 327797971200. Its totient is φ = 51020513280.
The previous prime is 130672969829. The next prime is 130672969877. The reversal of 130672969856 is 658969276031.
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 31 ways as a sum of consecutive naturals, for example, 15572510 + ... + 15580898.
It is an arithmetic number, because the mean of its divisors is an integer number (1280460825).
Almost surely, 2130672969856 is an apocalyptic number.
130672969856 is a gapful number since it is divisible by the number (16) 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 130672969856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163898985600).
130672969856 is an abundant number, since it is smaller than the sum of its proper divisors (197125001344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130672969856 is a wasteful number, since it uses less digits than its factorization.
130672969856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8487 (or 8475 counting only the distinct ones).
The product of its (nonzero) digits is 29393280, while the sum is 62.
The spelling of 130672969856 in words is "one hundred thirty billion, six hundred seventy-two million, nine hundred sixty-nine thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •