Base | Representation |
---|---|
bin | 11100101011011010011100… |
… | …01001000100110000000100 |
3 | 22021021220000121012101210220 |
4 | 32111231032021010300010 |
5 | 31231221204321340042 |
6 | 342043202520544340 |
7 | 16166150351515215 |
oct | 1625551611046004 |
9 | 267256017171726 |
10 | 63064315808772 |
11 | 19104476210953 |
12 | 70a63539220b0 |
13 | 2925c2a001575 |
14 | 118048736340c |
15 | 7456aa8a28ec |
hex | 395b4e244c04 |
63064315808772 has 12 divisors (see below), whose sum is σ = 147150070220496. Its totient is φ = 21021438602920.
The previous prime is 63064315808771. The next prime is 63064315808783. The reversal of 63064315808772 is 27780851346036.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is not an unprimeable number, because it can be changed into a prime (63064315808771) 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, 2627679825354 + ... + 2627679825377.
It is an arithmetic number, because the mean of its divisors is an integer number (12262505851708).
Almost surely, 263064315808772 is an apocalyptic number.
It is an amenable number.
63064315808772 is an abundant number, since it is smaller than the sum of its proper divisors (84085754411724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63064315808772 is a wasteful number, since it uses less digits than its factorization.
63064315808772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5255359650738 (or 5255359650736 counting only the distinct ones).
The product of its (nonzero) digits is 40642560, while the sum is 60.
The spelling of 63064315808772 in words is "sixty-three trillion, sixty-four billion, three hundred fifteen million, eight hundred eight thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •