Base | Representation |
---|---|
bin | 110000110000011011… |
… | …001001100110011011 |
3 | 12000010111120201202222 |
4 | 300300123021212123 |
5 | 1324204104444011 |
6 | 40014501414255 |
7 | 3532221631241 |
oct | 606033114633 |
9 | 160114521688 |
10 | 52352031131 |
11 | 202253a1934 |
12 | a19070a38b |
13 | 4c2413191a |
14 | 2768c64791 |
15 | 15660e2ddb |
hex | c306c999b |
52352031131 has 8 divisors (see below), whose sum is σ = 55451998080. Its totient is φ = 49254334848.
The previous prime is 52352031113. The next prime is 52352031139. The reversal of 52352031131 is 13113025325.
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 52352031131 - 214 = 52352014747 is a prime.
It is a super-2 number, since 2×523520311312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 52352031131.
It is not an unprimeable number, because it can be changed into a prime (52352031139) 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 7 ways as a sum of consecutive naturals, for example, 520076 + ... + 612521.
It is an arithmetic number, because the mean of its divisors is an integer number (6931499760).
Almost surely, 252352031131 is an apocalyptic number.
52352031131 is a deficient number, since it is larger than the sum of its proper divisors (3099966949).
52352031131 is a wasteful number, since it uses less digits than its factorization.
52352031131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1135333.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 52352031131 its reverse (13113025325), we get a palindrome (65465056456).
The spelling of 52352031131 in words is "fifty-two billion, three hundred fifty-two million, thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •