Base | Representation |
---|---|
bin | 11000100001001011… |
… | …01001010110101111 |
3 | 1020222100220011002111 |
4 | 30100211221112233 |
5 | 203424240043223 |
6 | 10014101104451 |
7 | 644124256030 |
oct | 142045512657 |
9 | 36870804074 |
10 | 13163206063 |
11 | 56453175a7 |
12 | 26743b8127 |
13 | 131a145837 |
14 | 8cc2d0a87 |
15 | 52093e30d |
hex | 3109695af |
13163206063 has 8 divisors (see below), whose sum is σ = 15928585632. Its totient is φ = 10619056896.
The previous prime is 13163206057. The next prime is 13163206103. The reversal of 13163206063 is 36060236131.
13163206063 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13163206063 - 29 = 13163205551 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13163206003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55307470 + ... + 55307707.
It is an arithmetic number, because the mean of its divisors is an integer number (1991073204).
Almost surely, 213163206063 is an apocalyptic number.
13163206063 is a deficient number, since it is larger than the sum of its proper divisors (2765379569).
13163206063 is a wasteful number, since it uses less digits than its factorization.
13163206063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110615201.
The product of its (nonzero) digits is 11664, while the sum is 31.
The spelling of 13163206063 in words is "thirteen billion, one hundred sixty-three million, two hundred six thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •