Base | Representation |
---|---|
bin | 110001011110101000… |
… | …101010010010011111 |
3 | 12002010112102201210110 |
4 | 301132220222102133 |
5 | 1332301043343311 |
6 | 40223434541103 |
7 | 3560354544600 |
oct | 613650522237 |
9 | 162115381713 |
10 | 53127324831 |
11 | 20592a98529 |
12 | a368297793 |
13 | 50189441a9 |
14 | 27ddbdbda7 |
15 | 15ae1d98a6 |
hex | c5ea2a49f |
53127324831 has 24 divisors (see below), whose sum is σ = 82540657584. Its totient is φ = 30307226880.
The previous prime is 53127324797. The next prime is 53127324839. The reversal of 53127324831 is 13842372135.
It is not a de Polignac number, because 53127324831 - 29 = 53127324319 is a prime.
It is a super-2 number, since 2×531273248312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 53127324831.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53127324839) by changing a digit.
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, 217560 + ... + 391901.
It is an arithmetic number, because the mean of its divisors is an integer number (3439194066).
Almost surely, 253127324831 is an apocalyptic number.
53127324831 is a deficient number, since it is larger than the sum of its proper divisors (29413332753).
53127324831 is a wasteful number, since it uses less digits than its factorization.
53127324831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610071 (or 610064 counting only the distinct ones).
The product of its digits is 120960, while the sum is 39.
Adding to 53127324831 its reverse (13842372135), we get a palindrome (66969696966).
The spelling of 53127324831 in words is "fifty-three billion, one hundred twenty-seven million, three hundred twenty-four thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •