Base | Representation |
---|---|
bin | 11000100110111001… |
… | …10010010010110011 |
3 | 1021002201020021000021 |
4 | 30103130302102303 |
5 | 204024032340102 |
6 | 10022534104311 |
7 | 645246321613 |
oct | 142334622263 |
9 | 37081207007 |
10 | 13211215027 |
11 | 566a42842a |
12 | 26884ab097 |
13 | 13270848ca |
14 | 8d482aa43 |
15 | 524c74137 |
hex | 3137324b3 |
13211215027 has 2 divisors, whose sum is σ = 13211215028. Its totient is φ = 13211215026.
The previous prime is 13211215013. The next prime is 13211215051. The reversal of 13211215027 is 72051211231.
13211215027 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13211215027 - 27 = 13211214899 is a prime.
It is a super-2 number, since 2×132112150272 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13211214992 and 13211215010.
It is not a weakly prime, because it can be changed into another prime (13211215057) 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, 6605607513 + 6605607514.
It is an arithmetic number, because the mean of its divisors is an integer number (6605607514).
Almost surely, 213211215027 is an apocalyptic number.
13211215027 is a deficient number, since it is larger than the sum of its proper divisors (1).
13211215027 is an equidigital number, since it uses as much as digits as its factorization.
13211215027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
Adding to 13211215027 its reverse (72051211231), we get a palindrome (85262426258).
The spelling of 13211215027 in words is "thirteen billion, two hundred eleven million, two hundred fifteen thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •