Base | Representation |
---|---|
bin | 11000100101100101… |
… | …10011110100001101 |
3 | 1021001221112012121121 |
4 | 30102302303310031 |
5 | 204013223224323 |
6 | 10021502200541 |
7 | 645053641540 |
oct | 142262636415 |
9 | 37057465547 |
10 | 13200211213 |
11 | 56641a2072 |
12 | 2684883151 |
13 | 1324a01187 |
14 | 8d31a4857 |
15 | 523ceda5d |
hex | 312cb3d0d |
13200211213 has 8 divisors (see below), whose sum is σ = 15606161280. Its totient is φ = 10924312560.
The previous prime is 13200211139. The next prime is 13200211223. The reversal of 13200211213 is 31211200231.
13200211213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13200211213 - 29 = 13200210701 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 (13200211223) 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 7 ways as a sum of consecutive naturals, for example, 32512633 + ... + 32513038.
It is an arithmetic number, because the mean of its divisors is an integer number (1950770160).
Almost surely, 213200211213 is an apocalyptic number.
It is an amenable number.
13200211213 is a deficient number, since it is larger than the sum of its proper divisors (2405950067).
13200211213 is an equidigital number, since it uses as much as digits as its factorization.
13200211213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65025707.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 13200211213 its reverse (31211200231), we get a palindrome (44411411444).
The spelling of 13200211213 in words is "thirteen billion, two hundred million, two hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •