Base | Representation |
---|---|
bin | 110001010111101101… |
… | …110111100110001110 |
3 | 12001211110000111102222 |
4 | 301113231313212032 |
5 | 1332031334441200 |
6 | 40204131015342 |
7 | 3554445120650 |
oct | 612755674616 |
9 | 161743014388 |
10 | 53011249550 |
11 | 20533517446 |
12 | a33543a552 |
13 | 4cca8927ac |
14 | 27cc6246d0 |
15 | 15a3e0bd85 |
hex | c57b7798e |
53011249550 has 24 divisors (see below), whose sum is σ = 112686771216. Its totient is φ = 18175285440.
The previous prime is 53011249541. The next prime is 53011249553. The reversal of 53011249550 is 5594211035.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 53011249550.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53011249553) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 75730007 + ... + 75730706.
It is an arithmetic number, because the mean of its divisors is an integer number (4695282134).
Almost surely, 253011249550 is an apocalyptic number.
53011249550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
53011249550 is an abundant number, since it is smaller than the sum of its proper divisors (59675521666).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53011249550 is a wasteful number, since it uses less digits than its factorization.
53011249550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151460732 (or 151460727 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 53011249550 in words is "fifty-three billion, eleven million, two hundred forty-nine thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •