Base | Representation |
---|---|
bin | 11000000110110011110101… |
… | …01011010111110111111000 |
3 | 20221200202110222212120020212 |
4 | 30003121322223113313320 |
5 | 23422011043401320220 |
6 | 304424412531210252 |
7 | 14110612466063432 |
oct | 1403317253276770 |
9 | 227622428776225 |
10 | 53010544557560 |
11 | 15988711469a47 |
12 | 5b41970146988 |
13 | 2376b469c6545 |
14 | d13a1cad7652 |
15 | 61ddd4e7c0c5 |
hex | 30367aad7df8 |
53010544557560 has 64 divisors (see below), whose sum is σ = 122617655949600. Its totient is φ = 20613422233600.
The previous prime is 53010544557547. The next prime is 53010544557569. The reversal of 53010544557560 is 6575544501035.
It is a junction number, because it is equal to n+sod(n) for n = 53010544557499 and 53010544557508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53010544557569) 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, 57054290 + ... + 57975969.
Almost surely, 253010544557560 is an apocalyptic number.
It is an amenable number.
53010544557560 is an abundant number, since it is smaller than the sum of its proper divisors (69607111392040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53010544557560 is a wasteful number, since it uses less digits than its factorization.
53010544557560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115030592 (or 115030588 counting only the distinct ones).
The product of its (nonzero) digits is 6300000, while the sum is 50.
The spelling of 53010544557560 in words is "fifty-three trillion, ten billion, five hundred forty-four million, five hundred fifty-seven thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •