Base | Representation |
---|---|
bin | 110000110011010011… |
… | …010110111101001011 |
3 | 12000020212110002002212 |
4 | 300303103112331023 |
5 | 1324303440222311 |
6 | 40023344415335 |
7 | 3533346242132 |
oct | 606323267513 |
9 | 160225402085 |
10 | 52400320331 |
11 | 2024a684267 |
12 | a1a491754b |
13 | 4c3113b408 |
14 | 2771434919 |
15 | 156a480c8b |
hex | c334d6f4b |
52400320331 has 8 divisors (see below), whose sum is σ = 54692989440. Its totient is φ = 50108850792.
The previous prime is 52400320327. The next prime is 52400320361. The reversal of 52400320331 is 13302300425.
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 52400320331 - 22 = 52400320327 is a prime.
It is a super-2 number, since 2×524003203312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52400320297 and 52400320306.
It is not an unprimeable number, because it can be changed into a prime (52400320321) 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, 210041 + ... + 385898.
It is an arithmetic number, because the mean of its divisors is an integer number (6836623680).
Almost surely, 252400320331 is an apocalyptic number.
52400320331 is a deficient number, since it is larger than the sum of its proper divisors (2292669109).
52400320331 is a wasteful number, since it uses less digits than its factorization.
52400320331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 599785.
The product of its (nonzero) digits is 2160, while the sum is 23.
Adding to 52400320331 its reverse (13302300425), we get a palindrome (65702620756).
The spelling of 52400320331 in words is "fifty-two billion, four hundred million, three hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •