Base | Representation |
---|---|
bin | 11000110001100110… |
… | …10010101100110011 |
3 | 1021022222011212020002 |
4 | 30120303102230303 |
5 | 204220024013021 |
6 | 10035502340215 |
7 | 650416433414 |
oct | 143063225463 |
9 | 37288155202 |
10 | 13301001011 |
11 | 5706082a21 |
12 | 26b258a66b |
13 | 133c8602cc |
14 | 90271d80b |
15 | 52caac50b |
hex | 318cd2b33 |
13301001011 has 2 divisors, whose sum is σ = 13301001012. Its totient is φ = 13301001010.
The previous prime is 13301000971. The next prime is 13301001013. The reversal of 13301001011 is 11010010331.
It is a happy number.
13301001011 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 a de Polignac number, because none of the positive numbers 2k-13301001011 is a prime.
Together with 13301001013, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13301000983 and 13301001001.
It is not a weakly prime, because it can be changed into another prime (13301001013) 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, 6650500505 + 6650500506.
It is an arithmetic number, because the mean of its divisors is an integer number (6650500506).
Almost surely, 213301001011 is an apocalyptic number.
13301001011 is a deficient number, since it is larger than the sum of its proper divisors (1).
13301001011 is an equidigital number, since it uses as much as digits as its factorization.
13301001011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 13301001011 its reverse (11010010331), we get a palindrome (24311011342).
The spelling of 13301001011 in words is "thirteen billion, three hundred one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •