Base | Representation |
---|---|
bin | 11000011010001011… |
… | …10000011111111101 |
3 | 1020211021110100011222 |
4 | 30031011300133331 |
5 | 203314223440234 |
6 | 10004203123125 |
7 | 642512353202 |
oct | 141505603775 |
9 | 36737410158 |
10 | 13104515069 |
11 | 5615180148 |
12 | 26588134a5 |
13 | 130ac36639 |
14 | 8c45b3ca9 |
15 | 51a6e942e |
hex | 30d1707fd |
13104515069 has 2 divisors, whose sum is σ = 13104515070. Its totient is φ = 13104515068.
The previous prime is 13104515063. The next prime is 13104515101. The reversal of 13104515069 is 96051540131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9411522169 + 3692992900 = 97013^2 + 60770^2 .
It is a cyclic number.
It is not a de Polignac number, because 13104515069 - 212 = 13104510973 is a prime.
It is a super-2 number, since 2×131045150692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13104515063) 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 as a sum of consecutive naturals, namely, 6552257534 + 6552257535.
It is an arithmetic number, because the mean of its divisors is an integer number (6552257535).
Almost surely, 213104515069 is an apocalyptic number.
It is an amenable number.
13104515069 is a deficient number, since it is larger than the sum of its proper divisors (1).
13104515069 is an equidigital number, since it uses as much as digits as its factorization.
13104515069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 35.
The spelling of 13104515069 in words is "thirteen billion, one hundred four million, five hundred fifteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •