Base | Representation |
---|---|
bin | 1000000000001000011101… |
… | …0111010010001011010000 |
3 | 1011011010010010012021111221 |
4 | 2000002013113102023100 |
5 | 2123123022144101003 |
6 | 30413525044214424 |
7 | 1565442443322142 |
oct | 200020727221320 |
9 | 34133103167457 |
10 | 8798364050128 |
11 | 2892402151644 |
12 | ba122239a414 |
13 | 4ba8b395b853 |
14 | 225bb3632c92 |
15 | 103ceb8067bd |
hex | 800875d22d0 |
8798364050128 has 40 divisors (see below), whose sum is σ = 17944255422720. Its totient is φ = 4167594224640.
The previous prime is 8798364050089. The next prime is 8798364050137. The reversal of 8798364050128 is 8210504638978.
It is a super-2 number, since 2×87983640501282 (a number of 27 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (61) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36584193 + ... + 36823903.
It is an arithmetic number, because the mean of its divisors is an integer number (448606385568).
It is a 1-persistent number, because it is pandigital, but 2⋅8798364050128 = 17596728100256 is not.
Almost surely, 28798364050128 is an apocalyptic number.
It is an amenable number.
8798364050128 is an abundant number, since it is smaller than the sum of its proper divisors (9145891372592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8798364050128 is a wasteful number, since it uses less digits than its factorization.
8798364050128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 360475 (or 360469 counting only the distinct ones).
The product of its (nonzero) digits is 23224320, while the sum is 61.
The spelling of 8798364050128 in words is "eight trillion, seven hundred ninety-eight billion, three hundred sixty-four million, fifty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •