Base | Representation |
---|---|
bin | 100011100101101011… |
… | …1110000110100100000 |
3 | 21022021021211211110010 |
4 | 1013023113300310200 |
5 | 2223010132320120 |
6 | 55035420004520 |
7 | 5343630043056 |
oct | 1071327606440 |
9 | 238237754403 |
10 | 76426448160 |
11 | 2a459812757 |
12 | 1298b090740 |
13 | 728c9850ba |
14 | 39b03121d6 |
15 | 1ec48d37e0 |
hex | 11cb5f0d20 |
76426448160 has 384 divisors, whose sum is σ = 261489150720. Its totient is φ = 18697568256.
The previous prime is 76426448159. The next prime is 76426448167. The reversal of 76426448160 is 6184462467.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (76426448167) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 98869534 + ... + 98870306.
It is an arithmetic number, because the mean of its divisors is an integer number (680961330).
Almost surely, 276426448160 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 76426448160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130744575360).
76426448160 is an abundant number, since it is smaller than the sum of its proper divisors (185062702560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76426448160 is a wasteful number, since it uses less digits than its factorization.
76426448160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1140 (or 1132 counting only the distinct ones).
The product of its (nonzero) digits is 1548288, while the sum is 48.
The spelling of 76426448160 in words is "seventy-six billion, four hundred twenty-six million, four hundred forty-eight thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •