Base | Representation |
---|---|
bin | 10001111000001100100111… |
… | …001101100110100010110000 |
3 | 101022101211020000021110202212 |
4 | 101320030213031212202300 |
5 | 40301222410241240130 |
6 | 435121254041031252 |
7 | 22363505414630435 |
oct | 2170144715464260 |
9 | 338354200243685 |
10 | 78628624165040 |
11 | 230652375517a4 |
12 | 899a907185528 |
13 | 34b4855582b11 |
14 | 155b907bb1b8c |
15 | 91549e732e95 |
hex | 4783273668b0 |
78628624165040 has 160 divisors (see below), whose sum is σ = 193213856736000. Its totient is φ = 29709313163264.
The previous prime is 78628624165037. The next prime is 78628624165079. The reversal of 78628624165040 is 4056142682687.
It is a super-2 number, since 2×786286241650402 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 284347166 + ... + 284623554.
It is an arithmetic number, because the mean of its divisors is an integer number (1207586604600).
Almost surely, 278628624165040 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 78628624165040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96606928368000).
78628624165040 is an abundant number, since it is smaller than the sum of its proper divisors (114585232570960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
78628624165040 is a wasteful number, since it uses less digits than its factorization.
78628624165040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279087 (or 279081 counting only the distinct ones).
The product of its (nonzero) digits is 30965760, while the sum is 59.
The spelling of 78628624165040 in words is "seventy-eight trillion, six hundred twenty-eight billion, six hundred twenty-four million, one hundred sixty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •