Base | Representation |
---|---|
bin | 111011011000101001… |
… | …111111001100100000 |
3 | 20002120212000112112220 |
4 | 323120221333030200 |
5 | 2021042143140202 |
6 | 45143140551040 |
7 | 4415066456100 |
oct | 733051771440 |
9 | 202525015486 |
10 | 63764427552 |
11 | 250513a2211 |
12 | 104366b2480 |
13 | 602261b107 |
14 | 312c805200 |
15 | 19d2e93abc |
hex | ed8a7f320 |
63764427552 has 288 divisors, whose sum is σ = 200222668800. Its totient is φ = 17706834432.
The previous prime is 63764427539. The next prime is 63764427553. The reversal of 63764427552 is 25572446736.
It is a junction number, because it is equal to n+sod(n) for n = 63764427495 and 63764427504.
It is not an unprimeable number, because it can be changed into a prime (63764427553) 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 47 ways as a sum of consecutive naturals, for example, 48342349 + ... + 48343667.
It is an arithmetic number, because the mean of its divisors is an integer number (695217600).
Almost surely, 263764427552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 63764427552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100111334400).
63764427552 is an abundant number, since it is smaller than the sum of its proper divisors (136458241248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63764427552 is a wasteful number, since it uses less digits than its factorization.
63764427552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1628 (or 1613 counting only the distinct ones).
The product of its digits is 8467200, while the sum is 51.
The spelling of 63764427552 in words is "sixty-three billion, seven hundred sixty-four million, four hundred twenty-seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •