Base | Representation |
---|---|
bin | 1011110101111111111101… |
… | …1110010011111000011011 |
3 | 1201002220220201010011212101 |
4 | 2331133333132103320123 |
5 | 3201324213443310021 |
6 | 43410213213024231 |
7 | 2512555345506322 |
oct | 275377736237033 |
9 | 51086821104771 |
10 | 13022332010011 |
11 | 4170815a23415 |
12 | 1563994785077 |
13 | 73600153501c |
14 | 3303d9d0d0b9 |
15 | 178b19ee8a91 |
hex | bd7ff793e1b |
13022332010011 has 2 divisors, whose sum is σ = 13022332010012. Its totient is φ = 13022332010010.
The previous prime is 13022332009969. The next prime is 13022332010033. The reversal of 13022332010011 is 11001023322031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13022332010011 - 227 = 13022197792283 is a prime.
It is a super-2 number, since 2×130223320100112 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13022332010911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6511166005005 + 6511166005006.
It is an arithmetic number, because the mean of its divisors is an integer number (6511166005006).
Almost surely, 213022332010011 is an apocalyptic number.
13022332010011 is a deficient number, since it is larger than the sum of its proper divisors (1).
13022332010011 is an equidigital number, since it uses as much as digits as its factorization.
13022332010011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13022332010011 its reverse (11001023322031), we get a palindrome (24023355332042).
The spelling of 13022332010011 in words is "thirteen trillion, twenty-two billion, three hundred thirty-two million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •