Base | Representation |
---|---|
bin | 110001101011000001… |
… | …011011100011111100 |
3 | 12002200000111002001122 |
4 | 301223001123203330 |
5 | 1333212244112300 |
6 | 40300221130112 |
7 | 3565460151455 |
oct | 615301334374 |
9 | 162600432048 |
10 | 53335144700 |
11 | 2068a331692 |
12 | a4059b9938 |
13 | 504ca08926 |
14 | 281d65812c |
15 | 15c258ac85 |
hex | c6b05b8fc |
53335144700 has 72 divisors (see below), whose sum is σ = 116610786432. Its totient is φ = 21173575680.
The previous prime is 53335144699. The next prime is 53335144781. The reversal of 53335144700 is 744153335.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 8817077 + ... + 8823123.
It is an arithmetic number, because the mean of its divisors is an integer number (1619594256).
Almost surely, 253335144700 is an apocalyptic number.
53335144700 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53335144700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58305393216).
53335144700 is an abundant number, since it is smaller than the sum of its proper divisors (63275641732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53335144700 is a wasteful number, since it uses less digits than its factorization.
53335144700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6711 (or 6704 counting only the distinct ones).
The product of its (nonzero) digits is 75600, while the sum is 35.
The spelling of 53335144700 in words is "fifty-three billion, three hundred thirty-five million, one hundred forty-four thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •