Base | Representation |
---|---|
bin | 110001111101010101… |
… | …100011100100001101 |
3 | 12010110102122210011022 |
4 | 301331111203210031 |
5 | 1334324424112003 |
6 | 40350515003525 |
7 | 3606210651425 |
oct | 617525434415 |
9 | 163412583138 |
10 | 53642410253 |
11 | 20827818863 |
12 | a4908995a5 |
13 | 509b57b773 |
14 | 284c39d485 |
15 | 15de532738 |
hex | c7d56390d |
53642410253 has 4 divisors (see below), whose sum is σ = 53644705980. Its totient is φ = 53640114528.
The previous prime is 53642410243. The next prime is 53642410291. The reversal of 53642410253 is 35201424635.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11530034884 + 42112375369 = 107378^2 + 205213^2 .
It is a cyclic number.
It is not a de Polignac number, because 53642410253 - 26 = 53642410189 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 (53642410223) 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 3 ways as a sum of consecutive naturals, for example, 1112450 + ... + 1159667.
It is an arithmetic number, because the mean of its divisors is an integer number (13411176495).
Almost surely, 253642410253 is an apocalyptic number.
It is an amenable number.
53642410253 is a deficient number, since it is larger than the sum of its proper divisors (2295727).
53642410253 is a wasteful number, since it uses less digits than its factorization.
53642410253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2295726.
The product of its (nonzero) digits is 86400, while the sum is 35.
Adding to 53642410253 its reverse (35201424635), we get a palindrome (88843834888).
The spelling of 53642410253 in words is "fifty-three billion, six hundred forty-two million, four hundred ten thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •