Base | Representation |
---|---|
bin | 111100111100000010… |
… | …1001011001010000000 |
3 | 110111210010000202122112 |
4 | 1321320011023022000 |
5 | 4121002043004331 |
6 | 140041245554452 |
7 | 12311631411530 |
oct | 1717005131200 |
9 | 414703022575 |
10 | 130863641216 |
11 | 50554128600 |
12 | 21441b75a28 |
13 | c456aaab39 |
14 | 649607d4c0 |
15 | 360daac32b |
hex | 1e7814b280 |
130863641216 has 768 divisors, whose sum is σ = 378589075200. Its totient is φ = 43794432000.
The previous prime is 130863641147. The next prime is 130863641231. The reversal of 130863641216 is 612146368031.
It is a hoax number, since the sum of its digits (41) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1295679566 + ... + 1295679666.
It is an arithmetic number, because the mean of its divisors is an integer number (492954525).
Almost surely, 2130863641216 is an apocalyptic number.
130863641216 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 130863641216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189294537600).
130863641216 is an abundant number, since it is smaller than the sum of its proper divisors (247725433984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130863641216 is a wasteful number, since it uses less digits than its factorization.
130863641216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217 (or 194 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 41.
The spelling of 130863641216 in words is "one hundred thirty billion, eight hundred sixty-three million, six hundred forty-one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •