Base | Representation |
---|---|
bin | 11000001001101111011000… |
… | …00100010011000011100010 |
3 | 20222001101101000111011100111 |
4 | 30010313230010103003202 |
5 | 23430133300134232032 |
6 | 304542543542441534 |
7 | 14121105551113030 |
oct | 1404675404230342 |
9 | 228041330434314 |
10 | 53111231164642 |
11 | 15a1738a427112 |
12 | 5b5938ba332aa |
13 | 23834a1836361 |
14 | d18851007550 |
15 | 6218295e0c47 |
hex | 304dec1130e2 |
53111231164642 has 32 divisors (see below), whose sum is σ = 94297824633600. Its totient is φ = 21951296595648.
The previous prime is 53111231164603. The next prime is 53111231164643. The reversal of 53111231164642 is 24646113211135.
It is a super-3 number, since 3×531112311646423 (a number of 42 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53111231164595 and 53111231164604.
It is not an unprimeable number, because it can be changed into a prime (53111231164643) 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 15 ways as a sum of consecutive naturals, for example, 76333542 + ... + 77026177.
It is an arithmetic number, because the mean of its divisors is an integer number (2946807019800).
Almost surely, 253111231164642 is an apocalyptic number.
53111231164642 is a deficient number, since it is larger than the sum of its proper divisors (41186593468958).
53111231164642 is a wasteful number, since it uses less digits than its factorization.
53111231164642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153360610.
The product of its digits is 103680, while the sum is 40.
Adding to 53111231164642 its reverse (24646113211135), we get a palindrome (77757344375777).
The spelling of 53111231164642 in words is "fifty-three trillion, one hundred eleven billion, two hundred thirty-one million, one hundred sixty-four thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •