Base | Representation |
---|---|
bin | 11101001000010101111110… |
… | …010011000111101110000000 |
3 | 121210121211120222211002200110 |
4 | 131020111332103013232000 |
5 | 113243030444243221302 |
6 | 1132251555420551320 |
7 | 35662061135306463 |
oct | 3510257623075600 |
9 | 553554528732613 |
10 | 128116698413952 |
11 | 37904a94294056 |
12 | 12451a5b0b2540 |
13 | 56644781bbc81 |
14 | 238cc4a3852da |
15 | ec29217a8b6c |
hex | 74857e4c7b80 |
128116698413952 has 64 divisors (see below), whose sum is σ = 352044807094800. Its totient is φ = 41232960405504.
The previous prime is 128116698413941. The next prime is 128116698413953. The reversal of 128116698413952 is 259314896611821.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128116698413953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5752354993 + ... + 5752377264.
Almost surely, 2128116698413952 is an apocalyptic number.
128116698413952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
128116698413952 is an abundant number, since it is smaller than the sum of its proper divisors (223928108680848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128116698413952 is a wasteful number, since it uses less digits than its factorization.
128116698413952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11504732303 (or 11504732291 counting only the distinct ones).
The product of its digits is 44789760, while the sum is 66.
The spelling of 128116698413952 in words is "one hundred twenty-eight trillion, one hundred sixteen billion, six hundred ninety-eight million, four hundred thirteen thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •