Base | Representation |
---|---|
bin | 1110101101001001110… |
… | …0110100111001111101 |
3 | 220011002211121121110001 |
4 | 3223102130310321331 |
5 | 13114401023002021 |
6 | 312021035514301 |
7 | 24152425002433 |
oct | 3532234647175 |
9 | 804084547401 |
10 | 252638875261 |
11 | 981640712a3 |
12 | 40b682b8991 |
13 | 1aa929c3746 |
14 | c329092d53 |
15 | 6889828091 |
hex | 3ad2734e7d |
252638875261 has 4 divisors (see below), whose sum is σ = 253388545852. Its totient is φ = 251889204672.
The previous prime is 252638875213. The next prime is 252638875273. The reversal of 252638875261 is 162578836252.
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 32777292025 + 219861583236 = 181045^2 + 468894^2 .
It is a cyclic number.
It is not a de Polignac number, because 252638875261 - 215 = 252638842493 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 (252638875211) 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 3 ways as a sum of consecutive naturals, for example, 374834790 + ... + 374835463.
It is an arithmetic number, because the mean of its divisors is an integer number (63347136463).
Almost surely, 2252638875261 is an apocalyptic number.
It is an amenable number.
252638875261 is a deficient number, since it is larger than the sum of its proper divisors (749670591).
252638875261 is an equidigital number, since it uses as much as digits as its factorization.
252638875261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 749670590.
The product of its digits is 9676800, while the sum is 55.
The spelling of 252638875261 in words is "two hundred fifty-two billion, six hundred thirty-eight million, eight hundred seventy-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •