Base | Representation |
---|---|
bin | 1011111010110001011010… |
… | …1010101010010001110101 |
3 | 1201101202112222100010212112 |
4 | 2332230112222222101311 |
5 | 3204200124312031234 |
6 | 43512013302100405 |
7 | 2521520254626164 |
oct | 276542652522165 |
9 | 51352488303775 |
10 | 13104325502069 |
11 | 41a257113159a |
12 | 157785811a705 |
13 | 74096a675c29 |
14 | 33437772b3db |
15 | 17ad184e1ace |
hex | beb16aaa475 |
13104325502069 has 2 divisors, whose sum is σ = 13104325502070. Its totient is φ = 13104325502068.
The previous prime is 13104325502063. The next prime is 13104325502141. The reversal of 13104325502069 is 96020552340131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10044145562500 + 3060179939569 = 3169250^2 + 1749337^2 .
It is an emirp because it is prime and its reverse (96020552340131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13104325502069 - 224 = 13104308724853 is a prime.
It is a super-2 number, since 2×131043255020692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13104325502063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552162751034 + 6552162751035.
It is an arithmetic number, because the mean of its divisors is an integer number (6552162751035).
Almost surely, 213104325502069 is an apocalyptic number.
It is an amenable number.
13104325502069 is a deficient number, since it is larger than the sum of its proper divisors (1).
13104325502069 is an equidigital number, since it uses as much as digits as its factorization.
13104325502069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 194400, while the sum is 41.
The spelling of 13104325502069 in words is "thirteen trillion, one hundred four billion, three hundred twenty-five million, five hundred two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •