Base | Representation |
---|---|
bin | 110001110101000010… |
… | …010011000111100110 |
3 | 12010002201121100100120 |
4 | 301311002103013212 |
5 | 1334033301110142 |
6 | 40325022022410 |
7 | 3602600136540 |
oct | 616502230746 |
9 | 163081540316 |
10 | 53503144422 |
11 | 20766148332 |
12 | a452117a06 |
13 | 507876a650 |
14 | 2837aaa690 |
15 | 15d21c37ec |
hex | c750931e6 |
53503144422 has 128 divisors (see below), whose sum is σ = 135238118400. Its totient is φ = 13733314560.
The previous prime is 53503144421. The next prime is 53503144427. The reversal of 53503144422 is 22444130535.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53503144421) 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 63 ways as a sum of consecutive naturals, for example, 10048653 + ... + 10053975.
It is an arithmetic number, because the mean of its divisors is an integer number (1056547800).
Almost surely, 253503144422 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53503144422, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67619059200).
53503144422 is an abundant number, since it is smaller than the sum of its proper divisors (81734973978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53503144422 is a wasteful number, since it uses less digits than its factorization.
53503144422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5838.
The product of its (nonzero) digits is 57600, while the sum is 33.
Adding to 53503144422 its reverse (22444130535), we get a palindrome (75947274957).
The spelling of 53503144422 in words is "fifty-three billion, five hundred three million, one hundred forty-four thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •