Base | Representation |
---|---|
bin | 110000101111111001… |
… | …100111011010000010 |
3 | 12000002220001010001110 |
4 | 300233321213122002 |
5 | 1324144332142242 |
6 | 40013545144150 |
7 | 3532054126122 |
oct | 605771473202 |
9 | 160086033043 |
10 | 52343240322 |
11 | 202204381aa |
12 | a18978b056 |
13 | 4c22374569 |
14 | 2767a16c82 |
15 | 156545839c |
hex | c2fe67682 |
52343240322 has 8 divisors (see below), whose sum is σ = 104686480656. Its totient is φ = 17447746772.
The previous prime is 52343240321. The next prime is 52343240333. The reversal of 52343240322 is 22304234325.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
52343240322 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 52343240322.
It is not an unprimeable number, because it can be changed into a prime (52343240321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4361936688 + ... + 4361936699.
It is an arithmetic number, because the mean of its divisors is an integer number (13085810082).
Almost surely, 252343240322 is an apocalyptic number.
52343240322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52343240322 is a wasteful number, since it uses less digits than its factorization.
52343240322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8723873392.
The product of its (nonzero) digits is 34560, while the sum is 30.
Adding to 52343240322 its reverse (22304234325), we get a palindrome (74647474647).
The spelling of 52343240322 in words is "fifty-two billion, three hundred forty-three million, two hundred forty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •