Base | Representation |
---|---|
bin | 110001101100000010… |
… | …111110010110000011 |
3 | 12002201012211000002202 |
4 | 301230002332112003 |
5 | 1333231143422111 |
6 | 40302033303415 |
7 | 3566056202330 |
oct | 615402762603 |
9 | 162635730082 |
10 | 53352326531 |
11 | 20698aa7649 |
12 | a40b704b6b |
13 | 50534433aa |
14 | 2821a4b987 |
15 | 15c3d31b3b |
hex | c6c0be583 |
53352326531 has 4 divisors (see below), whose sum is σ = 60974087472. Its totient is φ = 45730565592.
The previous prime is 53352326519. The next prime is 53352326543. The reversal of 53352326531 is 13562325335.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (53352326519) and next prime (53352326543).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53352326531 is a prime.
It is a super-2 number, since 2×533523265312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53352326551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3810880460 + ... + 3810880473.
It is an arithmetic number, because the mean of its divisors is an integer number (15243521868).
Almost surely, 253352326531 is an apocalyptic number.
53352326531 is a deficient number, since it is larger than the sum of its proper divisors (7621760941).
53352326531 is an equidigital number, since it uses as much as digits as its factorization.
53352326531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7621760940.
The product of its digits is 243000, while the sum is 38.
The spelling of 53352326531 in words is "fifty-three billion, three hundred fifty-two million, three hundred twenty-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •