Base | Representation |
---|---|
bin | 110000101011001101… |
… | …001001110111101001 |
3 | 11222220101211110220102 |
4 | 300223031021313221 |
5 | 1324014201214022 |
6 | 40002053035145 |
7 | 3530106500666 |
oct | 605315116751 |
9 | 158811743812 |
10 | 52264476137 |
11 | 2018aa30535 |
12 | a167325ab5 |
13 | 4c0bc57833 |
14 | 275b392a6d |
15 | 155d59aa92 |
hex | c2b349de9 |
52264476137 has 4 divisors (see below), whose sum is σ = 52450470996. Its totient is φ = 52078481280.
The previous prime is 52264476127. The next prime is 52264476149. The reversal of 52264476137 is 73167446225.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 24528571456 + 27735904681 = 156616^2 + 166541^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52264476137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52264476091 and 52264476100.
It is not an unprimeable number, because it can be changed into a prime (52264476127) 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, 92997008 + ... + 92997569.
It is an arithmetic number, because the mean of its divisors is an integer number (13112617749).
Almost surely, 252264476137 is an apocalyptic number.
It is an amenable number.
52264476137 is a deficient number, since it is larger than the sum of its proper divisors (185994859).
52264476137 is a wasteful number, since it uses less digits than its factorization.
52264476137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185994858.
The product of its digits is 1693440, while the sum is 47.
The spelling of 52264476137 in words is "fifty-two billion, two hundred sixty-four million, four hundred seventy-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •