Base | Representation |
---|---|
bin | 110001010111110101… |
… | …110001011100111111 |
3 | 12001211120220202200011 |
4 | 301113311301130333 |
5 | 1332032402242120 |
6 | 40204243244051 |
7 | 3554501540506 |
oct | 612765613477 |
9 | 161746822604 |
10 | 53013321535 |
11 | 20534702129 |
12 | a336079627 |
13 | 4ccb139915 |
14 | 27cca0383d |
15 | 15a41bac5a |
hex | c57d7173f |
53013321535 has 32 divisors (see below), whose sum is σ = 65040814080. Its totient is φ = 41471160192.
The previous prime is 53013321527. The next prime is 53013321593. The reversal of 53013321535 is 53512331035.
It is a cyclic number.
It is not a de Polignac number, because 53013321535 - 23 = 53013321527 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53013321497 and 53013321506.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 48769762 + ... + 48770848.
It is an arithmetic number, because the mean of its divisors is an integer number (2032525440).
Almost surely, 253013321535 is an apocalyptic number.
53013321535 is a deficient number, since it is larger than the sum of its proper divisors (12027492545).
53013321535 is a wasteful number, since it uses less digits than its factorization.
53013321535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2095.
The product of its (nonzero) digits is 20250, while the sum is 31.
The spelling of 53013321535 in words is "fifty-three billion, thirteen million, three hundred twenty-one thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •