Base | Representation |
---|---|
bin | 11000011001001110010110… |
… | …11110110011100101100101 |
3 | 21000221020122001101010120111 |
4 | 30030213023132303211211 |
5 | 24012342344131111323 |
6 | 310031212411533021 |
7 | 14204412000100165 |
oct | 1414471336634545 |
9 | 230836561333514 |
10 | 53643260410213 |
11 | 16101a8502a8a1 |
12 | 602450b45a171 |
13 | 23c16cb593036 |
14 | d364c1d845a5 |
15 | 6305b708ac0d |
hex | 30c9cb7b3965 |
53643260410213 has 4 divisors (see below), whose sum is σ = 53643303848448. Its totient is φ = 53643216971980.
The previous prime is 53643260410199. The next prime is 53643260410231. The reversal of 53643260410213 is 31201406234635.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 53643260410213 - 213 = 53643260402021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53643260410283) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19810831 + ... + 22355212.
It is an arithmetic number, because the mean of its divisors is an integer number (13410825962112).
Almost surely, 253643260410213 is an apocalyptic number.
It is an amenable number.
53643260410213 is a deficient number, since it is larger than the sum of its proper divisors (43438235).
53643260410213 is a wasteful number, since it uses less digits than its factorization.
53643260410213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43438234.
The product of its (nonzero) digits is 311040, while the sum is 40.
Adding to 53643260410213 its reverse (31201406234635), we get a palindrome (84844666644848).
The spelling of 53643260410213 in words is "fifty-three trillion, six hundred forty-three billion, two hundred sixty million, four hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •