Base | Representation |
---|---|
bin | 111100000000011101… |
… | …0001100010101110000 |
3 | 110022121202212101010121 |
4 | 1320000322030111300 |
5 | 4102403223230101 |
6 | 135111024340024 |
7 | 12211243153120 |
oct | 1700072142560 |
9 | 408552771117 |
10 | 128864273776 |
11 | 4a718583217 |
12 | 20b84474614 |
13 | c1c87c5694 |
14 | 634670ac80 |
15 | 35432c20a1 |
hex | 1e00e8c570 |
128864273776 has 160 divisors (see below), whose sum is σ = 305119042560. Its totient is φ = 51530299392.
The previous prime is 128864273761. The next prime is 128864273777. The reversal of 128864273776 is 677372468821.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128864273777) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24435876 + ... + 24441148.
It is an arithmetic number, because the mean of its divisors is an integer number (1906994016).
Almost surely, 2128864273776 is an apocalyptic number.
128864273776 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 128864273776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152559521280).
128864273776 is an abundant number, since it is smaller than the sum of its proper divisors (176254768784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128864273776 is a wasteful number, since it uses less digits than its factorization.
128864273776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5543 (or 5537 counting only the distinct ones).
The product of its digits is 37933056, while the sum is 61.
The spelling of 128864273776 in words is "one hundred twenty-eight billion, eight hundred sixty-four million, two hundred seventy-three thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •