Base | Representation |
---|---|
bin | 1100000000011010010100… |
… | …0001011110111011111111 |
3 | 1201202000121112200120000101 |
4 | 3000012211001132323333 |
5 | 3212242031000130421 |
6 | 44024314325541531 |
7 | 2531520056111353 |
oct | 300064501367377 |
9 | 51660545616011 |
10 | 13201203130111 |
11 | 422a6650153a7 |
12 | 15925942748a7 |
13 | 749b393266a9 |
14 | 338d27c0d463 |
15 | 17d5d8564191 |
hex | c01a505eeff |
13201203130111 has 4 divisors (see below), whose sum is σ = 13221797831424. Its totient is φ = 13180608428800.
The previous prime is 13201203130099. The next prime is 13201203130147. The reversal of 13201203130111 is 11103130210231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13201203130111 - 211 = 13201203128063 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13201203130411) 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 in 3 ways as a sum of consecutive naturals, for example, 10297349695 + ... + 10297350976.
It is an arithmetic number, because the mean of its divisors is an integer number (3305449457856).
Almost surely, 213201203130111 is an apocalyptic number.
13201203130111 is a deficient number, since it is larger than the sum of its proper divisors (20594701313).
13201203130111 is an equidigital number, since it uses as much as digits as its factorization.
13201203130111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20594701312.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13201203130111 its reverse (11103130210231), we get a palindrome (24304333340342).
The spelling of 13201203130111 in words is "thirteen trillion, two hundred one billion, two hundred three million, one hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •