Base | Representation |
---|---|
bin | 1010000010010010010110… |
… | …0111101001100001010101 |
3 | 1110001212201110100011102021 |
4 | 2200210211213221201111 |
5 | 2421241423421242401 |
6 | 35245045004413141 |
7 | 2216131525406353 |
oct | 240444547514125 |
9 | 43055643304367 |
10 | 11034402134101 |
11 | 357473337a4a5 |
12 | 12a265ab471b1 |
13 | 620702818618 |
14 | 2a20d44d27d3 |
15 | 14206b9de2a1 |
hex | a09259e9855 |
11034402134101 has 2 divisors, whose sum is σ = 11034402134102. Its totient is φ = 11034402134100.
The previous prime is 11034402134071. The next prime is 11034402134113. The reversal of 11034402134101 is 10143120443011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10799176164100 + 235225970001 = 3286210^2 + 485001^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11034402134101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11034402134801) 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, 5517201067050 + 5517201067051.
It is an arithmetic number, because the mean of its divisors is an integer number (5517201067051).
Almost surely, 211034402134101 is an apocalyptic number.
It is an amenable number.
11034402134101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11034402134101 is an equidigital number, since it uses as much as digits as its factorization.
11034402134101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 11034402134101 its reverse (10143120443011), we get a palindrome (21177522577112).
The spelling of 11034402134101 in words is "eleven trillion, thirty-four billion, four hundred two million, one hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •