Base | Representation |
---|---|
bin | 11000100001100001… |
… | …01100101000001101 |
3 | 1020222120100100000102 |
4 | 30100300230220031 |
5 | 203431010244203 |
6 | 10014243140445 |
7 | 644161013045 |
oct | 142060545015 |
9 | 36876310012 |
10 | 13166103053 |
11 | 5646a16104 |
12 | 2675374725 |
13 | 131a91b32c |
14 | 8cc846725 |
15 | 520d12888 |
hex | 310c2ca0d |
13166103053 has 8 divisors (see below), whose sum is σ = 13304980920. Its totient is φ = 13027921920.
The previous prime is 13166103019. The next prime is 13166103059. The reversal of 13166103053 is 35030166131.
It can be written as a sum of positive squares in 4 ways, for example, as 815559364 + 12350543689 = 28558^2 + 111133^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13166103053 - 210 = 13166102029 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13166103059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 136148 + ... + 211821.
It is an arithmetic number, because the mean of its divisors is an integer number (1663122615).
Almost surely, 213166103053 is an apocalyptic number.
It is an amenable number.
13166103053 is a deficient number, since it is larger than the sum of its proper divisors (138877867).
13166103053 is a wasteful number, since it uses less digits than its factorization.
13166103053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348367.
The product of its (nonzero) digits is 4860, while the sum is 29.
Adding to 13166103053 its reverse (35030166131), we get a palindrome (48196269184).
The spelling of 13166103053 in words is "thirteen billion, one hundred sixty-six million, one hundred three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •