Base | Representation |
---|---|
bin | 11000001000001001110101… |
… | …00110010101101110001101 |
3 | 20221212011122122002011221121 |
4 | 30010010322212111232031 |
5 | 23423240122304331321 |
6 | 304501530141400541 |
7 | 14114135560035640 |
oct | 1404047246255615 |
9 | 227764578064847 |
10 | 53056714136461 |
11 | 159a6253a42a22 |
12 | 5b4a8b6269151 |
13 | 237b2c400a2b9 |
14 | d15d5c817a57 |
15 | 6201d83e7441 |
hex | 30413a995b8d |
53056714136461 has 32 divisors (see below), whose sum is σ = 63730708715520. Its totient is φ = 43184995736256.
The previous prime is 53056714136407. The next prime is 53056714136467. The reversal of 53056714136461 is 16463141765035.
It is not a de Polignac number, because 53056714136461 - 29 = 53056714135949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53056714136399 and 53056714136408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53056714136467) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 683796310 + ... + 683873896.
It is an arithmetic number, because the mean of its divisors is an integer number (1991584647360).
Almost surely, 253056714136461 is an apocalyptic number.
It is an amenable number.
53056714136461 is a deficient number, since it is larger than the sum of its proper divisors (10673994579059).
53056714136461 is a wasteful number, since it uses less digits than its factorization.
53056714136461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108313.
The product of its (nonzero) digits is 5443200, while the sum is 52.
The spelling of 53056714136461 in words is "fifty-three trillion, fifty-six billion, seven hundred fourteen million, one hundred thirty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •