Base | Representation |
---|---|
bin | 11000100101100101… |
… | …10011110100100101 |
3 | 1021001221112012122111 |
4 | 30102302303310211 |
5 | 204013223224422 |
6 | 10021502201021 |
7 | 645053641603 |
oct | 142262636445 |
9 | 37057465574 |
10 | 13200211237 |
11 | 56641a2094 |
12 | 2684883171 |
13 | 1324a011a5 |
14 | 8d31a4873 |
15 | 523ceda77 |
hex | 312cb3d25 |
13200211237 has 2 divisors, whose sum is σ = 13200211238. Its totient is φ = 13200211236.
The previous prime is 13200211223. The next prime is 13200211243. The reversal of 13200211237 is 73211200231.
It is a happy number.
13200211237 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13180417636 + 19793601 = 114806^2 + 4449^2 .
It is a cyclic number.
It is not a de Polignac number, because 13200211237 - 219 = 13199686949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13200211247) 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 as a sum of consecutive naturals, namely, 6600105618 + 6600105619.
It is an arithmetic number, because the mean of its divisors is an integer number (6600105619).
Almost surely, 213200211237 is an apocalyptic number.
It is an amenable number.
13200211237 is a deficient number, since it is larger than the sum of its proper divisors (1).
13200211237 is an equidigital number, since it uses as much as digits as its factorization.
13200211237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 22.
Adding to 13200211237 its reverse (73211200231), we get a palindrome (86411411468).
The spelling of 13200211237 in words is "thirteen billion, two hundred million, two hundred eleven thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •