Base | Representation |
---|---|
bin | 110000011111000101… |
… | …011010101000100101 |
3 | 11222101020011222011221 |
4 | 300133011122220211 |
5 | 1323110121333221 |
6 | 35525550300341 |
7 | 3522060141025 |
oct | 603705325045 |
9 | 158336158157 |
10 | 52061121061 |
11 | 20096166894 |
12 | a10b1b76b1 |
13 | 4ba8a973a1 |
14 | 273c379a85 |
15 | 154a7cc541 |
hex | c1f15aa25 |
52061121061 has 8 divisors (see below), whose sum is σ = 52974562784. Its totient is φ = 51149614320.
The previous prime is 52061121017. The next prime is 52061121089. The reversal of 52061121061 is 16012116025.
It is a happy number.
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 52061121061 - 225 = 52027566629 is a prime.
It is a super-2 number, since 2×520611210612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52061121661) 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, 429411 + ... + 537136.
It is an arithmetic number, because the mean of its divisors is an integer number (6621820348).
Almost surely, 252061121061 is an apocalyptic number.
It is an amenable number.
52061121061 is a deficient number, since it is larger than the sum of its proper divisors (913441723).
52061121061 is an equidigital number, since it uses as much as digits as its factorization.
52061121061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 967491.
The product of its (nonzero) digits is 720, while the sum is 25.
Adding to 52061121061 its reverse (16012116025), we get a palindrome (68073237086).
The spelling of 52061121061 in words is "fifty-two billion, sixty-one million, one hundred twenty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •