Base | Representation |
---|---|
bin | 11000010110101100100111… |
… | …10000010000101111010010 |
3 | 21000121221111102022221110111 |
4 | 30023112103300100233102 |
5 | 24004432030041203200 |
6 | 305523252115351534 |
7 | 14165216110551544 |
oct | 1413262360205722 |
9 | 230557442287414 |
10 | 53556426116050 |
11 | 16079175369420 |
12 | 600b7168b25aa |
13 | 23b6470592ba0 |
14 | d322056a5694 |
15 | 62d1d3ad60ba |
hex | 30b593c10bd2 |
53556426116050 has 96 divisors (see below), whose sum is σ = 117815593694400. Its totient is φ = 17856330950400.
The previous prime is 53556426116029. The next prime is 53556426116071. The reversal of 53556426116050 is 5061162465535.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (53556426116029) and next prime (53556426116071).
It is a junction number, because it is equal to n+sod(n) for n = 53556426115985 and 53556426116003.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24070252 + ... + 26200951.
It is an arithmetic number, because the mean of its divisors is an integer number (1227245767650).
Almost surely, 253556426116050 is an apocalyptic number.
53556426116050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
53556426116050 is an abundant number, since it is smaller than the sum of its proper divisors (64259167578350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53556426116050 is a wasteful number, since it uses less digits than its factorization.
53556426116050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50271388 (or 50271383 counting only the distinct ones).
The product of its (nonzero) digits is 3240000, while the sum is 49.
The spelling of 53556426116050 in words is "fifty-three trillion, five hundred fifty-six billion, four hundred twenty-six million, one hundred sixteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •