Base | Representation |
---|---|
bin | 11000100110111000… |
… | …00000010001010101 |
3 | 1021002200211211221121 |
4 | 30103130000101111 |
5 | 204024004311013 |
6 | 10022525443541 |
7 | 645244506346 |
oct | 142334002125 |
9 | 37080754847 |
10 | 13211010133 |
11 | 566a2a84a2 |
12 | 26884105b1 |
13 | 1327012579 |
14 | 8d47b60cd |
15 | 524c3358d |
hex | 313700455 |
13211010133 has 2 divisors, whose sum is σ = 13211010134. Its totient is φ = 13211010132.
The previous prime is 13211010121. The next prime is 13211010203. The reversal of 13211010133 is 33101011231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12419319364 + 791690769 = 111442^2 + 28137^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13211010133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13211010433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6605505066 + 6605505067.
It is an arithmetic number, because the mean of its divisors is an integer number (6605505067).
Almost surely, 213211010133 is an apocalyptic number.
It is an amenable number.
13211010133 is a deficient number, since it is larger than the sum of its proper divisors (1).
13211010133 is an equidigital number, since it uses as much as digits as its factorization.
13211010133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 13211010133 its reverse (33101011231), we get a palindrome (46312021364).
The spelling of 13211010133 in words is "thirteen billion, two hundred eleven million, ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •