Base | Representation |
---|---|
bin | 11000010000010110… |
… | …10111111001110111 |
3 | 1020121112101021111011 |
4 | 30020023113321313 |
5 | 203132124213421 |
6 | 5552100453051 |
7 | 640462014235 |
oct | 141013277167 |
9 | 36545337434 |
10 | 13022101111 |
11 | 5582700338 |
12 | 26350aa187 |
13 | 12c6b3c596 |
14 | 8b767d955 |
15 | 51336a4e1 |
hex | 3082d7e77 |
13022101111 has 2 divisors, whose sum is σ = 13022101112. Its totient is φ = 13022101110.
The previous prime is 13022101097. The next prime is 13022101139. The reversal of 13022101111 is 11110122031.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13022101111 - 221 = 13020003959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13022101091 and 13022101100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13022101171) 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, 6511050555 + 6511050556.
It is an arithmetic number, because the mean of its divisors is an integer number (6511050556).
Almost surely, 213022101111 is an apocalyptic number.
13022101111 is a deficient number, since it is larger than the sum of its proper divisors (1).
13022101111 is an equidigital number, since it uses as much as digits as its factorization.
13022101111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 13022101111 its reverse (11110122031), we get a palindrome (24132223142).
The spelling of 13022101111 in words is "thirteen billion, twenty-two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •