Base | Representation |
---|---|
bin | 11000011001010000111110… |
… | …01011001000000000110011 |
3 | 21000221101020220111011121110 |
4 | 30030220133023020000303 |
5 | 24012403233110142024 |
6 | 310032004011124403 |
7 | 14204461540011534 |
oct | 1414503713100063 |
9 | 230841226434543 |
10 | 53644664537139 |
11 | 16102635688175 |
12 | 6024841743703 |
13 | 23c1893458080 |
14 | d365b664c68b |
15 | 63064a498629 |
hex | 30ca1f2c8033 |
53644664537139 has 32 divisors (see below), whose sum is σ = 78858251619840. Its totient is φ = 32228562094848.
The previous prime is 53644664537099. The next prime is 53644664537173. The reversal of 53644664537139 is 93173546644635.
It is not a de Polignac number, because 53644664537139 - 231 = 53642517053491 is a prime.
It is a super-2 number, since 2×536446645371392 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 53644664537139.
It is not an unprimeable number, because it can be changed into a prime (53644664532139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4424754 + ... + 11263559.
It is an arithmetic number, because the mean of its divisors is an integer number (2464320363120).
Almost surely, 253644664537139 is an apocalyptic number.
53644664537139 is a deficient number, since it is larger than the sum of its proper divisors (25213587082701).
53644664537139 is a wasteful number, since it uses less digits than its factorization.
53644664537139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15690411.
The product of its digits is 587865600, while the sum is 66.
The spelling of 53644664537139 in words is "fifty-three trillion, six hundred forty-four billion, six hundred sixty-four million, five hundred thirty-seven thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •