Base | Representation |
---|---|
bin | 11101001010110000000001… |
… | …110001001001111110100000 |
3 | 121211012122120000021121102120 |
4 | 131022300001301021332200 |
5 | 113303233231343010224 |
6 | 1132455553350344240 |
7 | 36010035226020042 |
oct | 3512600161117640 |
9 | 554178500247376 |
10 | 128282112860064 |
11 | 37969158446769 |
12 | 12479b2405b080 |
13 | 5676c4a116257 |
14 | 2396c5d001a92 |
15 | ec6da3766779 |
hex | 74ac01c49fa0 |
128282112860064 has 48 divisors (see below), whose sum is σ = 336840797341440. Its totient is φ = 42747973990400.
The previous prime is 128282112860029. The next prime is 128282112860119. The reversal of 128282112860064 is 460068211282821.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-3 number, since 3×1282821128600643 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 128282112859989 and 128282112860016.
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, 198586737 + ... + 199231664.
It is an arithmetic number, because the mean of its divisors is an integer number (7017516611280).
Almost surely, 2128282112860064 is an apocalyptic number.
It is an amenable number.
128282112860064 is an abundant number, since it is smaller than the sum of its proper divisors (208558684481376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128282112860064 is a wasteful number, since it uses less digits than its factorization.
128282112860064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 397821773 (or 397821765 counting only the distinct ones).
The product of its (nonzero) digits is 1179648, while the sum is 51.
The spelling of 128282112860064 in words is "one hundred twenty-eight trillion, two hundred eighty-two billion, one hundred twelve million, eight hundred sixty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •