Base | Representation |
---|---|
bin | 1100000010001101100010… |
… | …0010100001011100010011 |
3 | 1201211222110001012002222012 |
4 | 3000203120202201130103 |
5 | 3213243401320401321 |
6 | 44050431351133135 |
7 | 2533663366632401 |
oct | 300433042413423 |
9 | 51758401162865 |
10 | 13232132200211 |
11 | 4241796736561 |
12 | 15985863741ab |
13 | 74ca28022ac2 |
14 | 33a61d7c0471 |
15 | 17e2e8a0d05b |
hex | c08d88a1713 |
13232132200211 has 4 divisors (see below), whose sum is σ = 13380807843000. Its totient is φ = 13083456557424.
The previous prime is 13232132200207. The next prime is 13232132200283. The reversal of 13232132200211 is 11200223123231.
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 13232132200211 - 22 = 13232132200207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13232132200291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 74337821261 + ... + 74337821438.
It is an arithmetic number, because the mean of its divisors is an integer number (3345201960750).
Almost surely, 213232132200211 is an apocalyptic number.
13232132200211 is a deficient number, since it is larger than the sum of its proper divisors (148675642789).
13232132200211 is an equidigital number, since it uses as much as digits as its factorization.
13232132200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148675642788.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13232132200211 its reverse (11200223123231), we get a palindrome (24432355323442).
The spelling of 13232132200211 in words is "thirteen trillion, two hundred thirty-two billion, one hundred thirty-two million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •