Base | Representation |
---|---|
bin | 110010000000000100… |
… | …101111110010111110 |
3 | 12010120122002000211020 |
4 | 302000010233302332 |
5 | 1334423203214200 |
6 | 40355235205010 |
7 | 3610306215423 |
oct | 620004576276 |
9 | 163518060736 |
10 | 53688335550 |
11 | 20850736153 |
12 | a4a4146766 |
13 | 50a7c3b2b5 |
14 | 2854515d4a |
15 | 15e35a4ea0 |
hex | c8012fcbe |
53688335550 has 48 divisors (see below), whose sum is σ = 133207425072. Its totient is φ = 14310400000.
The previous prime is 53688335543. The next prime is 53688335563. The reversal of 53688335550 is 5553388635.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 53688335493 and 53688335502.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 255550 + ... + 415550.
It is an arithmetic number, because the mean of its divisors is an integer number (2775154689).
Almost surely, 253688335550 is an apocalyptic number.
53688335550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
53688335550 is an abundant number, since it is smaller than the sum of its proper divisors (79519089522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53688335550 is a wasteful number, since it uses less digits than its factorization.
53688335550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162253 (or 162248 counting only the distinct ones).
The product of its (nonzero) digits is 6480000, while the sum is 51.
It can be divided in two parts, 53688 and 335550, that multiplied together give a square (18015008400 = 1342202).
The spelling of 53688335550 in words is "fifty-three billion, six hundred eighty-eight million, three hundred thirty-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •