Base | Representation |
---|---|
bin | 110000101111101110… |
… | …000110000010011101 |
3 | 12000002200100200000221 |
4 | 300233232012002131 |
5 | 1324143044020221 |
6 | 40013400321341 |
7 | 3532016346523 |
oct | 605756060235 |
9 | 160080320027 |
10 | 52340220061 |
11 | 20219765018 |
12 | a188773251 |
13 | 4c2185791c |
14 | 276746c313 |
15 | 156505d541 |
hex | c2fb8609d |
52340220061 has 12 divisors (see below), whose sum is σ = 52681432860. Its totient is φ = 52001102400.
The previous prime is 52340220047. The next prime is 52340220071. The reversal of 52340220061 is 16002204325.
52340220061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 18081911961 + 34258308100 = 134469^2 + 185090^2 .
It is not a de Polignac number, because 52340220061 - 211 = 52340218013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52340220011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 40230111 + ... + 40231411.
It is an arithmetic number, because the mean of its divisors is an integer number (4390119405).
Almost surely, 252340220061 is an apocalyptic number.
It is an amenable number.
52340220061 is a deficient number, since it is larger than the sum of its proper divisors (341212799).
52340220061 is an equidigital number, since it uses as much as digits as its factorization.
52340220061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2556 (or 2333 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 52340220061 its reverse (16002204325), we get a palindrome (68342424386).
The spelling of 52340220061 in words is "fifty-two billion, three hundred forty million, two hundred twenty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •