Base | Representation |
---|---|
bin | 11000110101110010… |
… | …11011101100001101 |
3 | 1021102102100101022222 |
4 | 30122321123230031 |
5 | 204303024241013 |
6 | 10043200145125 |
7 | 651324350624 |
oct | 143271335415 |
9 | 37372311288 |
10 | 13336165133 |
11 | 5723a10285 |
12 | 27023081a5 |
13 | 1346c22995 |
14 | 9072746bb |
15 | 530c06508 |
hex | 31ae5bb0d |
13336165133 has 4 divisors (see below), whose sum is σ = 13336430460. Its totient is φ = 13335899808.
The previous prime is 13336165111. The next prime is 13336165159. The reversal of 13336165133 is 33156163331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 705327364 + 12630837769 = 26558^2 + 112387^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13336165133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13336165093 and 13336165102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13336165103) 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, 31610 + ... + 166347.
It is an arithmetic number, because the mean of its divisors is an integer number (3334107615).
Almost surely, 213336165133 is an apocalyptic number.
It is an amenable number.
13336165133 is a deficient number, since it is larger than the sum of its proper divisors (265327).
13336165133 is an equidigital number, since it uses as much as digits as its factorization.
13336165133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265326.
The product of its digits is 43740, while the sum is 35.
The spelling of 13336165133 in words is "thirteen billion, three hundred thirty-six million, one hundred sixty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •