Base | Representation |
---|---|
bin | 1100000010011110101010… |
… | …1100010101110011100001 |
3 | 1201212102022121000111021122 |
4 | 3000213222230111303201 |
5 | 3213332311310344134 |
6 | 44052512015102025 |
7 | 2534215360202552 |
oct | 300475254256341 |
9 | 51772277014248 |
10 | 13236731731169 |
11 | 4243736a88211 |
12 | 159944a811915 |
13 | 7502abc0775b |
14 | 33a9385d8329 |
15 | 17e4b770c02e |
hex | c09eab15ce1 |
13236731731169 has 2 divisors, whose sum is σ = 13236731731170. Its totient is φ = 13236731731168.
The previous prime is 13236731731159. The next prime is 13236731731183. The reversal of 13236731731169 is 96113713763231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13236681150625 + 50580544 = 3638225^2 + 7112^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13236731731169 is a prime.
It is a super-2 number, since 2×132367317311692 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13236731731169.
It is not a weakly prime, because it can be changed into another prime (13236731731159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6618365865584 + 6618365865585.
It is an arithmetic number, because the mean of its divisors is an integer number (6618365865585).
Almost surely, 213236731731169 is an apocalyptic number.
It is an amenable number.
13236731731169 is a deficient number, since it is larger than the sum of its proper divisors (1).
13236731731169 is an equidigital number, since it uses as much as digits as its factorization.
13236731731169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2571912, while the sum is 53.
The spelling of 13236731731169 in words is "thirteen trillion, two hundred thirty-six billion, seven hundred thirty-one million, seven hundred thirty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •