Base | Representation |
---|---|
bin | 1011110101111111111110… |
… | …0010100000011101011111 |
3 | 1201002220220210012001220211 |
4 | 2331133333202200131133 |
5 | 3201324214234010421 |
6 | 43410213252353251 |
7 | 2512555361040523 |
oct | 275377742403537 |
9 | 51086823161824 |
10 | 13022333110111 |
11 | 4170816604996 |
12 | 1563995015827 |
13 | 73600182b980 |
14 | 3303da117d83 |
15 | 178b1a1649e1 |
hex | bd7ff8a075f |
13022333110111 has 4 divisors (see below), whose sum is σ = 14024051041672. Its totient is φ = 12020615178552.
The previous prime is 13022333110109. The next prime is 13022333110117. The reversal of 13022333110111 is 11101133322031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13022333110111 - 21 = 13022333110109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13022333110117) 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 in 3 ways as a sum of consecutive naturals, for example, 500858965761 + ... + 500858965786.
It is an arithmetic number, because the mean of its divisors is an integer number (3506012760418).
Almost surely, 213022333110111 is an apocalyptic number.
13022333110111 is a deficient number, since it is larger than the sum of its proper divisors (1001717931561).
13022333110111 is a wasteful number, since it uses less digits than its factorization.
13022333110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001717931560.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13022333110111 its reverse (11101133322031), we get a palindrome (24123466432142).
The spelling of 13022333110111 in words is "thirteen trillion, twenty-two billion, three hundred thirty-three million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •