Base | Representation |
---|---|
bin | 10111111010010010001000… |
… | …11000011111000101001001 |
3 | 20220011121112010221111120001 |
4 | 23331021010120133011021 |
5 | 23342433110022011311 |
6 | 303454551553403001 |
7 | 14034534544316260 |
oct | 1375110430370511 |
9 | 226147463844501 |
10 | 52580136907081 |
11 | 158321245827a3 |
12 | 5a92471569461 |
13 | 2345393703514 |
14 | cdac6c2d35d7 |
15 | 612ae3c844c1 |
hex | 2fd24461f149 |
52580136907081 has 4 divisors (see below), whose sum is σ = 60091585036672. Its totient is φ = 45068688777492.
The previous prime is 52580136907043. The next prime is 52580136907099. The reversal of 52580136907081 is 18070963108525.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52580136907081 is a prime.
It is a super-2 number, since 2×525801369070812 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (52580136907981) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3755724064785 + ... + 3755724064798.
It is an arithmetic number, because the mean of its divisors is an integer number (15022896259168).
Almost surely, 252580136907081 is an apocalyptic number.
It is an amenable number.
52580136907081 is a deficient number, since it is larger than the sum of its proper divisors (7511448129591).
52580136907081 is an equidigital number, since it uses as much as digits as its factorization.
52580136907081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7511448129590.
The product of its (nonzero) digits is 3628800, while the sum is 55.
The spelling of 52580136907081 in words is "fifty-two trillion, five hundred eighty billion, one hundred thirty-six million, nine hundred seven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •