Base | Representation |
---|---|
bin | 11000011101010110… |
… | …10000011010010111 |
3 | 1020220010112010110222 |
4 | 30032223100122113 |
5 | 203343031403302 |
6 | 10010553304555 |
7 | 643254461321 |
oct | 141653203227 |
9 | 36803463428 |
10 | 13131122327 |
11 | 56291a3614 |
12 | 266570515b |
13 | 13135c128b |
14 | 8c7d3c611 |
15 | 51cc02da2 |
hex | 30ead0697 |
13131122327 has 2 divisors, whose sum is σ = 13131122328. Its totient is φ = 13131122326.
The previous prime is 13131122317. The next prime is 13131122339. The reversal of 13131122327 is 72322113131.
13131122327 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 an emirp because it is prime and its reverse (72322113131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13131122327 - 28 = 13131122071 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13131122296 and 13131122305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13131122317) 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, 6565561163 + 6565561164.
It is an arithmetic number, because the mean of its divisors is an integer number (6565561164).
Almost surely, 213131122327 is an apocalyptic number.
13131122327 is a deficient number, since it is larger than the sum of its proper divisors (1).
13131122327 is an equidigital number, since it uses as much as digits as its factorization.
13131122327 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1512, while the sum is 26.
Adding to 13131122327 its reverse (72322113131), we get a palindrome (85453235458).
The spelling of 13131122327 in words is "thirteen billion, one hundred thirty-one million, one hundred twenty-two thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •