Base | Representation |
---|---|
bin | 1100000000011001100100… |
… | …0010001111001101101101 |
3 | 1201202000002112020011002201 |
4 | 3000012121002033031231 |
5 | 3212241123003020021 |
6 | 44024242343021501 |
7 | 2531512064413024 |
oct | 300063102171555 |
9 | 51660075204081 |
10 | 13201002001261 |
11 | 422a571531308 |
12 | 1592538a3a891 |
13 | 749b06765639 |
14 | 338d092158bb |
15 | 17d5c5a85591 |
hex | c019908f36d |
13201002001261 has 2 divisors, whose sum is σ = 13201002001262. Its totient is φ = 13201002001260.
The previous prime is 13201002001207. The next prime is 13201002001277. The reversal of 13201002001261 is 16210020010231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7116121771236 + 6084880230025 = 2667606^2 + 2466755^2 .
It is a cyclic number.
It is not a de Polignac number, because 13201002001261 - 29 = 13201002000749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13201002001961) 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, 6600501000630 + 6600501000631.
It is an arithmetic number, because the mean of its divisors is an integer number (6600501000631).
Almost surely, 213201002001261 is an apocalyptic number.
It is an amenable number.
13201002001261 is a deficient number, since it is larger than the sum of its proper divisors (1).
13201002001261 is an equidigital number, since it uses as much as digits as its factorization.
13201002001261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 13201002001261 its reverse (16210020010231), we get a palindrome (29411022011492).
The spelling of 13201002001261 in words is "thirteen trillion, two hundred one billion, two million, one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •