Base | Representation |
---|---|
bin | 1100000000111011000101… |
… | …0110111000011111111001 |
3 | 1201202212022121112220021221 |
4 | 3000032301112320133321 |
5 | 3212413040000013032 |
6 | 44032331253232041 |
7 | 2532251054223331 |
oct | 300166126703771 |
9 | 51685277486257 |
10 | 13210000001017 |
11 | 4233369686746 |
12 | 159422a332621 |
13 | 74a90b995351 |
14 | 33952026a0c1 |
15 | 17d9509b9597 |
hex | c03b15b87f9 |
13210000001017 has 2 divisors, whose sum is σ = 13210000001018. Its totient is φ = 13210000001016.
The previous prime is 13210000000987. The next prime is 13210000001027. The reversal of 13210000001017 is 71010000001231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11932955356921 + 1277044644096 = 3454411^2 + 1130064^2 .
It is an emirp because it is prime and its reverse (71010000001231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13210000001017 is a prime.
It is not a weakly prime, because it can be changed into another prime (13210000001027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6605000000508 + 6605000000509.
It is an arithmetic number, because the mean of its divisors is an integer number (6605000000509).
Almost surely, 213210000001017 is an apocalyptic number.
It is an amenable number.
13210000001017 is a deficient number, since it is larger than the sum of its proper divisors (1).
13210000001017 is an equidigital number, since it uses as much as digits as its factorization.
13210000001017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 16.
Adding to 13210000001017 its reverse (71010000001231), we get a palindrome (84220000002248).
The spelling of 13210000001017 in words is "thirteen trillion, two hundred ten billion, one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •