Base | Representation |
---|---|
bin | 11000100101100101… |
… | …10011110010111011 |
3 | 1021001221112012111120 |
4 | 30102302303302323 |
5 | 204013223224011 |
6 | 10021502200323 |
7 | 645053641362 |
oct | 142262636273 |
9 | 37057465446 |
10 | 13200211131 |
11 | 56641a1aa8 |
12 | 26848830a3 |
13 | 1324a01123 |
14 | 8d31a47d9 |
15 | 523ceda06 |
hex | 312cb3cbb |
13200211131 has 16 divisors (see below), whose sum is σ = 18279079200. Its totient is φ = 8466087168.
The previous prime is 13200211127. The next prime is 13200211133. The reversal of 13200211131 is 13111200231.
It is a happy number.
It is not a de Polignac number, because 13200211131 - 22 = 13200211127 is a prime.
It is a super-2 number, since 2×132002111312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13200211131.
It is not an unprimeable number, because it can be changed into a prime (13200211133) 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 in 15 ways as a sum of consecutive naturals, for example, 658216 + ... + 677973.
It is an arithmetic number, because the mean of its divisors is an integer number (1142442450).
Almost surely, 213200211131 is an apocalyptic number.
13200211131 is a deficient number, since it is larger than the sum of its proper divisors (5078868069).
13200211131 is a wasteful number, since it uses less digits than its factorization.
13200211131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1336318.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 13200211131 its reverse (13111200231), we get a palindrome (26311411362).
The spelling of 13200211131 in words is "thirteen billion, two hundred million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •