Base | Representation |
---|---|
bin | 1100000000011101010010… |
… | …0001110010111111011011 |
3 | 1201202002200002101100100012 |
4 | 3000013110201302333123 |
5 | 3212300144013130021 |
6 | 44024525400232135 |
7 | 2531545604361260 |
oct | 300072441627733 |
9 | 51662602340305 |
10 | 13202000130011 |
11 | 422aa33997200 |
12 | 159277716b64b |
13 | 749c35498b74 |
14 | 338da19d7267 |
15 | 17d6334e735b |
hex | c01d4872fdb |
13202000130011 has 24 divisors (see below), whose sum is σ = 16988826658272. Its totient is φ = 10036363708800.
The previous prime is 13202000129993. The next prime is 13202000130037. The reversal of 13202000130011 is 11003100020231.
13202000130011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13202000130011 - 26 = 13202000129947 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13202000130091) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 190047920 + ... + 190117373.
It is an arithmetic number, because the mean of its divisors is an integer number (707867777428).
Almost surely, 213202000130011 is an apocalyptic number.
13202000130011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13202000130011 is a deficient number, since it is larger than the sum of its proper divisors (3786826528261).
13202000130011 is a wasteful number, since it uses less digits than its factorization.
13202000130011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 380165363 (or 380165352 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 13202000130011 its reverse (11003100020231), we get a palindrome (24205100150242).
The spelling of 13202000130011 in words is "thirteen trillion, two hundred two billion, one hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •