Base | Representation |
---|---|
bin | 110000111101000111… |
… | …111101110111010011 |
3 | 12000200100112001201122 |
4 | 300331013331313103 |
5 | 1330123131344011 |
6 | 40051552352455 |
7 | 3540420013166 |
oct | 607507756723 |
9 | 160610461648 |
10 | 52565106131 |
11 | 203246a527a |
12 | a22bb4572b |
13 | 4c593162c5 |
14 | 278928badd |
15 | 1579b813db |
hex | c3d1fddd3 |
52565106131 has 16 divisors (see below), whose sum is σ = 55909439040. Its totient is φ = 49316636160.
The previous prime is 52565106067. The next prime is 52565106133. The reversal of 52565106131 is 13160156525.
It is a cyclic number.
It is not a de Polignac number, because 52565106131 - 26 = 52565106067 is a prime.
It is a super-2 number, since 2×525651061312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52565106091 and 52565106100.
It is not an unprimeable number, because it can be changed into a prime (52565106133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 217415 + ... + 390383.
It is an arithmetic number, because the mean of its divisors is an integer number (3494339940).
Almost surely, 252565106131 is an apocalyptic number.
52565106131 is a deficient number, since it is larger than the sum of its proper divisors (3344332909).
52565106131 is a wasteful number, since it uses less digits than its factorization.
52565106131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173246.
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 52565106131 in words is "fifty-two billion, five hundred sixty-five million, one hundred six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •