Base | Representation |
---|---|
bin | 1100000110001110001101… |
… | …0010110010010010010011 |
3 | 1202002120021210111201102222 |
4 | 3001203203102302102103 |
5 | 3220411003204213021 |
6 | 44142224303131255 |
7 | 2541652655263634 |
oct | 301434322622223 |
9 | 52076253451388 |
10 | 13301032101011 |
11 | 4268a32955836 |
12 | 15a99b48a3b2b |
13 | 756388583585 |
14 | 33dab826d88b |
15 | 180ecc7686ab |
hex | c18e34b2493 |
13301032101011 has 2 divisors, whose sum is σ = 13301032101012. Its totient is φ = 13301032101010.
The previous prime is 13301032100989. The next prime is 13301032101013. The reversal of 13301032101011 is 11010123010331.
It is a strong prime.
It is an emirp because it is prime and its reverse (11010123010331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13301032101011 is a prime.
Together with 13301032101013, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13301032101013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650516050505 + 6650516050506.
It is an arithmetic number, because the mean of its divisors is an integer number (6650516050506).
Almost surely, 213301032101011 is an apocalyptic number.
13301032101011 is a deficient number, since it is larger than the sum of its proper divisors (1).
13301032101011 is an equidigital number, since it uses as much as digits as its factorization.
13301032101011 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 17.
Adding to 13301032101011 its reverse (11010123010331), we get a palindrome (24311155111342).
The spelling of 13301032101011 in words is "thirteen trillion, three hundred one billion, thirty-two million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •