Base | Representation |
---|---|
bin | 1100000000011010110000… |
… | …0000000111001100001011 |
3 | 1201202000220200222220002102 |
4 | 3000012230000013030023 |
5 | 3212242300433224321 |
6 | 44024334111224015 |
7 | 2531523010224566 |
oct | 300065400071413 |
9 | 51660820886072 |
10 | 13201320211211 |
11 | 422a715113140 |
12 | 159260751800b |
13 | 749b5766ab52 |
14 | 338d395a94dd |
15 | 17d5e398ec0b |
hex | c01ac00730b |
13201320211211 has 8 divisors (see below), whose sum is σ = 14432953234224. Its totient is φ = 11974939355520.
The previous prime is 13201320211159. The next prime is 13201320211213. The reversal of 13201320211211 is 11211202310231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13201320211211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13201320211213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1313036570 + ... + 1313046623.
It is an arithmetic number, because the mean of its divisors is an integer number (1804119154278).
Almost surely, 213201320211211 is an apocalyptic number.
13201320211211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13201320211211 is a deficient number, since it is larger than the sum of its proper divisors (1231633023013).
13201320211211 is a wasteful number, since it uses less digits than its factorization.
13201320211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2626083661.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 13201320211211 its reverse (11211202310231), we get a palindrome (24412522521442).
The spelling of 13201320211211 in words is "thirteen trillion, two hundred one billion, three hundred twenty million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •