Base | Representation |
---|---|
bin | 111011011111011000… |
… | …001110101101111001 |
3 | 20002212201020122011112 |
4 | 323133120032231321 |
5 | 2021310031304144 |
6 | 45202250210105 |
7 | 4420636231556 |
oct | 733730165571 |
9 | 202781218145 |
10 | 63877213049 |
11 | 250aa026671 |
12 | 10468423935 |
13 | 603caba2b0 |
14 | 313d7a3a2d |
15 | 19dcd2199e |
hex | edf60eb79 |
63877213049 has 8 divisors (see below), whose sum is σ = 68795207880. Its totient is φ = 58959841536.
The previous prime is 63877213021. The next prime is 63877213061. The reversal of 63877213049 is 94031277836.
It can be written as a sum of positive squares in 4 ways, for example, as 38403457024 + 25473756025 = 195968^2 + 159605^2 .
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 63877213049 - 28 = 63877212793 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 63877212988 and 63877213006.
It is not an unprimeable number, because it can be changed into a prime (63877213079) 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 7 ways as a sum of consecutive naturals, for example, 69047 + ... + 364035.
It is an arithmetic number, because the mean of its divisors is an integer number (8599400985).
Almost surely, 263877213049 is an apocalyptic number.
It is an amenable number.
63877213049 is a deficient number, since it is larger than the sum of its proper divisors (4917994831).
63877213049 is a wasteful number, since it uses less digits than its factorization.
63877213049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311659.
The product of its (nonzero) digits is 1524096, while the sum is 50.
The spelling of 63877213049 in words is "sixty-three billion, eight hundred seventy-seven million, two hundred thirteen thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •