Base | Representation |
---|---|
bin | 11000100110111100… |
… | …00000101111010011 |
3 | 1021002201211120202201 |
4 | 30103132000233103 |
5 | 204024123130324 |
6 | 10022545024031 |
7 | 645252130441 |
oct | 142336005723 |
9 | 37081746681 |
10 | 13211536339 |
11 | 566a627881 |
12 | 2688625017 |
13 | 1327167c31 |
14 | 8d48b1b91 |
15 | 524cd9444 |
hex | 313780bd3 |
13211536339 has 2 divisors, whose sum is σ = 13211536340. Its totient is φ = 13211536338.
The previous prime is 13211536319. The next prime is 13211536357. The reversal of 13211536339 is 93363511231.
13211536339 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 is a cyclic number.
It is not a de Polignac number, because 13211536339 - 219 = 13211012051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13211536298 and 13211536307.
It is not a weakly prime, because it can be changed into another prime (13211536309) 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, 6605768169 + 6605768170.
It is an arithmetic number, because the mean of its divisors is an integer number (6605768170).
Almost surely, 213211536339 is an apocalyptic number.
13211536339 is a deficient number, since it is larger than the sum of its proper divisors (1).
13211536339 is an equidigital number, since it uses as much as digits as its factorization.
13211536339 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 43740, while the sum is 37.
The spelling of 13211536339 in words is "thirteen billion, two hundred eleven million, five hundred thirty-six thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •