Base | Representation |
---|---|
bin | 11100111001000100101001… |
… | …01011010101011000111001 |
3 | 22022221202110100110122012221 |
4 | 32130202110223111120321 |
5 | 31311413404030131301 |
6 | 343042542311004041 |
7 | 16245104042623603 |
oct | 1634422453253071 |
9 | 268852410418187 |
10 | 63533650630201 |
11 | 19275519509864 |
12 | 71612b7069621 |
13 | 295b27501a55b |
14 | 119908ba6a173 |
15 | 7529c92b6da1 |
hex | 39c894ad5639 |
63533650630201 has 16 divisors (see below), whose sum is σ = 64143063715968. Its totient is φ = 62926486761600.
The previous prime is 63533650630199. The next prime is 63533650630243. The reversal of 63533650630201 is 10203605633536.
63533650630201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 63533650630201 - 21 = 63533650630199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (63533650660201) 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 15 ways as a sum of consecutive naturals, for example, 125354586 + ... + 125860396.
It is an arithmetic number, because the mean of its divisors is an integer number (4008941482248).
Almost surely, 263533650630201 is an apocalyptic number.
It is an amenable number.
63533650630201 is a deficient number, since it is larger than the sum of its proper divisors (609413085767).
63533650630201 is a wasteful number, since it uses less digits than its factorization.
63533650630201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508032.
The product of its (nonzero) digits is 874800, while the sum is 43.
The spelling of 63533650630201 in words is "sixty-three trillion, five hundred thirty-three billion, six hundred fifty million, six hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •