Base | Representation |
---|---|
bin | 11100110111000011010000… |
… | …01011101010110011001100 |
3 | 22022201010011010222110201112 |
4 | 32123201220023222303030 |
5 | 31304244122232430202 |
6 | 342551013254031152 |
7 | 16240064441601656 |
oct | 1633415013526314 |
9 | 268633133873645 |
10 | 63464184655052 |
11 | 19249011803545 |
12 | 714b94b0484b8 |
13 | 295485440bc4c |
14 | 119597bd456d6 |
15 | 750cb09e0b52 |
hex | 39b8682eaccc |
63464184655052 has 12 divisors (see below), whose sum is σ = 111157167153816. Its totient is φ = 31704994039680.
The previous prime is 63464184655031. The next prime is 63464184655117. The reversal of 63464184655052 is 25055648146436.
63464184655052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 63464184654982 and 63464184655000.
It is an unprimeable number.
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, 6774566693 + ... + 6774576060.
It is an arithmetic number, because the mean of its divisors is an integer number (9263097262818).
Almost surely, 263464184655052 is an apocalyptic number.
It is an amenable number.
63464184655052 is a deficient number, since it is larger than the sum of its proper divisors (47692982498764).
63464184655052 is a wasteful number, since it uses less digits than its factorization.
63464184655052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13549143928 (or 13549143926 counting only the distinct ones).
The product of its (nonzero) digits is 82944000, while the sum is 59.
The spelling of 63464184655052 in words is "sixty-three trillion, four hundred sixty-four billion, one hundred eighty-four million, six hundred fifty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •