Base | Representation |
---|---|
bin | 11101001111000000010101… |
… | …100011101110100101101100 |
3 | 121212020121021011021102220002 |
4 | 131033000111203232211230 |
5 | 113323031040140113320 |
6 | 1133242151110443432 |
7 | 36040126015223513 |
oct | 3517002543564554 |
9 | 555217234242802 |
10 | 128574502660460 |
11 | 37a7115a9043aa |
12 | 12506724963578 |
13 | 56986a63b196c |
14 | 23a707954767a |
15 | ece7b7c76675 |
hex | 74f0158ee96c |
128574502660460 has 48 divisors (see below), whose sum is σ = 275824444371840. Its totient is φ = 50322193443840.
The previous prime is 128574502660451. The next prime is 128574502660463. The reversal of 128574502660460 is 64066205475821.
It is a junction number, because it is equal to n+sod(n) for n = 128574502660396 and 128574502660405.
It is not an unprimeable number, because it can be changed into a prime (128574502660463) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14602721 + ... + 21688440.
It is an arithmetic number, because the mean of its divisors is an integer number (5746342591080).
Almost surely, 2128574502660460 is an apocalyptic number.
128574502660460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
128574502660460 is an abundant number, since it is smaller than the sum of its proper divisors (147249941711380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128574502660460 is a wasteful number, since it uses less digits than its factorization.
128574502660460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36294986 (or 36294984 counting only the distinct ones).
The product of its (nonzero) digits is 19353600, while the sum is 56.
The spelling of 128574502660460 in words is "one hundred twenty-eight trillion, five hundred seventy-four billion, five hundred two million, six hundred sixty thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •