Base | Representation |
---|---|
bin | 11101001111100100001110… |
… | …001010110010011101001101 |
3 | 121212101021201102122012021121 |
4 | 131033210032022302131031 |
5 | 113324143443021402403 |
6 | 1133312002322000541 |
7 | 36042661602054640 |
oct | 3517441612623515 |
9 | 555337642565247 |
10 | 128613033387853 |
11 | 37a8653245a163 |
12 | 125120987a6151 |
13 | 569c206c40041 |
14 | 23a8c9292da57 |
15 | ed07c07833bd |
hex | 74f90e2b274d |
128613033387853 has 8 divisors (see below), whose sum is σ = 146987012471040. Its totient is φ = 110239226454480.
The previous prime is 128613033387767. The next prime is 128613033387913. The reversal of 128613033387853 is 358783330316821.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 128613033387853 - 217 = 128613033256781 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 128613033387791 and 128613033387800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128613033387253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41432533 + ... + 44428378.
It is an arithmetic number, because the mean of its divisors is an integer number (18373376558880).
Almost surely, 2128613033387853 is an apocalyptic number.
It is an amenable number.
128613033387853 is a deficient number, since it is larger than the sum of its proper divisors (18373979083187).
128613033387853 is an equidigital number, since it uses as much as digits as its factorization.
128613033387853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86074907.
The product of its (nonzero) digits is 52254720, while the sum is 61.
The spelling of 128613033387853 in words is "one hundred twenty-eight trillion, six hundred thirteen billion, thirty-three million, three hundred eighty-seven thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •