Base | Representation |
---|---|
bin | 1011111010110000100101… |
… | …1010101100000000000011 |
3 | 1201101201222111001120212101 |
4 | 2332230021122230000003 |
5 | 3204144200410223021 |
6 | 43511535241411231 |
7 | 2521511615321251 |
oct | 276541132540003 |
9 | 51351874046771 |
10 | 13104103211011 |
11 | 41a2467703a7a |
12 | 15777b5799b17 |
13 | 7409335b5767 |
14 | 334355dc55d1 |
15 | 17ad03c32a91 |
hex | beb096ac003 |
13104103211011 has 2 divisors, whose sum is σ = 13104103211012. Its totient is φ = 13104103211010.
The previous prime is 13104103210963. The next prime is 13104103211047. The reversal of 13104103211011 is 11011230140131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13104103211011 - 27 = 13104103210883 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13104103211011.
It is not a weakly prime, because it can be changed into another prime (13104103211071) 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, 6552051605505 + 6552051605506.
It is an arithmetic number, because the mean of its divisors is an integer number (6552051605506).
Almost surely, 213104103211011 is an apocalyptic number.
13104103211011 is a deficient number, since it is larger than the sum of its proper divisors (1).
13104103211011 is an equidigital number, since it uses as much as digits as its factorization.
13104103211011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 13104103211011 its reverse (11011230140131), we get a palindrome (24115333351142).
The spelling of 13104103211011 in words is "thirteen trillion, one hundred four billion, one hundred three million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •