Base | Representation |
---|---|
bin | 110001011001101011… |
… | …110000110101100000 |
3 | 12001220202010012021221 |
4 | 301121223300311200 |
5 | 1332113312031000 |
6 | 40211310224424 |
7 | 3555325463005 |
oct | 613153606540 |
9 | 161822105257 |
10 | 53044252000 |
11 | 205501086a3 |
12 | a3444b5114 |
13 | 500467927c |
14 | 27d2b758ac |
15 | 15a6c7a61a |
hex | c59af0d60 |
53044252000 has 48 divisors (see below), whose sum is σ = 130329736992. Its totient is φ = 21217699200.
The previous prime is 53044251991. The next prime is 53044252007. The reversal of 53044252000 is 25244035.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53044252007) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 6626532 + ... + 6634531.
It is an arithmetic number, because the mean of its divisors is an integer number (2715202854).
Almost surely, 253044252000 is an apocalyptic number.
53044252000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
53044252000 is an abundant number, since it is smaller than the sum of its proper divisors (77285484992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53044252000 is a wasteful number, since it uses less digits than its factorization.
53044252000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13261088 (or 13261070 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 25.
Adding to 53044252000 its reverse (25244035), we get a palindrome (53069496035).
The spelling of 53044252000 in words is "fifty-three billion, forty-four million, two hundred fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •