Base | Representation |
---|---|
bin | 110001010111110101… |
… | …010111100100101101 |
3 | 12001211120201101021011 |
4 | 301113311113210231 |
5 | 1332032340344113 |
6 | 40204241105221 |
7 | 3554500616455 |
oct | 612765274455 |
9 | 161746641234 |
10 | 53013215533 |
11 | 2053463a523 |
12 | a336028211 |
13 | 4ccb1005b5 |
14 | 27cc9b6d65 |
15 | 15a419963d |
hex | c57d5792d |
53013215533 has 8 divisors (see below), whose sum is σ = 54485885952. Its totient is φ = 51542644176.
The previous prime is 53013215369. The next prime is 53013215561. The reversal of 53013215533 is 33551231035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53013215533 - 229 = 52476344621 is a prime.
It is a super-2 number, since 2×530132155332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53013215495 and 53013215504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53013212533) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 473485 + ... + 574642.
It is an arithmetic number, because the mean of its divisors is an integer number (6810735744).
Almost surely, 253013215533 is an apocalyptic number.
It is an amenable number.
53013215533 is a deficient number, since it is larger than the sum of its proper divisors (1472670419).
53013215533 is a wasteful number, since it uses less digits than its factorization.
53013215533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049531.
The product of its (nonzero) digits is 20250, while the sum is 31.
Adding to 53013215533 its reverse (33551231035), we get a palindrome (86564446568).
The spelling of 53013215533 in words is "fifty-three billion, thirteen million, two hundred fifteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •