Base | Representation |
---|---|
bin | 1011111011101100101000… |
… | …0011101111100111110111 |
3 | 1201110021120200211102201221 |
4 | 2332323022003233213313 |
5 | 3204430202321213421 |
6 | 43523202414331211 |
7 | 2522622166531114 |
oct | 276731203574767 |
9 | 51407520742657 |
10 | 13120220101111 |
11 | 41a9288227062 |
12 | 157a9531b9b07 |
13 | 742301647216 |
14 | 3350446a390b |
15 | 17b448b17841 |
hex | beeca0ef9f7 |
13120220101111 has 2 divisors, whose sum is σ = 13120220101112. Its totient is φ = 13120220101110.
The previous prime is 13120220101063. The next prime is 13120220101201. The reversal of 13120220101111 is 11110102202131.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13120220101111 - 29 = 13120220100599 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13120220101811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6560110050555 + 6560110050556.
It is an arithmetic number, because the mean of its divisors is an integer number (6560110050556).
Almost surely, 213120220101111 is an apocalyptic number.
13120220101111 is a deficient number, since it is larger than the sum of its proper divisors (1).
13120220101111 is an equidigital number, since it uses as much as digits as its factorization.
13120220101111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 13120220101111 its reverse (11110102202131), we get a palindrome (24230322303242).
The spelling of 13120220101111 in words is "thirteen trillion, one hundred twenty billion, two hundred twenty million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •