Base | Representation |
---|---|
bin | 11000000111001001101001… |
… | …00011111011110110110001 |
3 | 20221201212200222120101020210 |
4 | 30003210310203323312301 |
5 | 23422204033243321221 |
6 | 304434030430054333 |
7 | 14111505601066116 |
oct | 1403446443736661 |
9 | 227655628511223 |
10 | 53022253104561 |
11 | 1599267a654674 |
12 | 5b4409934a3a9 |
13 | 2377c91663670 |
14 | d1440db2890d |
15 | 61e36cd2b276 |
hex | 3039348fbdb1 |
53022253104561 has 16 divisors (see below), whose sum is σ = 76601600215616. Its totient is φ = 32428900431936.
The previous prime is 53022253104517. The next prime is 53022253104581. The reversal of 53022253104561 is 16540135222035.
It is not a de Polignac number, because 53022253104561 - 27 = 53022253104433 is a prime.
It is a super-2 number, since 2×530222531045612 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53022253104581) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4170376930 + ... + 4170389643.
It is an arithmetic number, because the mean of its divisors is an integer number (4787600013476).
Almost surely, 253022253104561 is an apocalyptic number.
It is an amenable number.
53022253104561 is a deficient number, since it is larger than the sum of its proper divisors (23579347111055).
53022253104561 is a wasteful number, since it uses less digits than its factorization.
53022253104561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8340766752.
The product of its (nonzero) digits is 216000, while the sum is 39.
Adding to 53022253104561 its reverse (16540135222035), we get a palindrome (69562388326596).
The spelling of 53022253104561 in words is "fifty-three trillion, twenty-two billion, two hundred fifty-three million, one hundred four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •