Base | Representation |
---|---|
bin | 1010000011011100100011… |
… | …1001010010110011100111 |
3 | 1110010210010122210101202201 |
4 | 2200313020321102303213 |
5 | 2422103222224040142 |
6 | 35302141325515331 |
7 | 2220435246556243 |
oct | 240671071226347 |
9 | 43123118711681 |
10 | 11054321315047 |
11 | 3582125218a0a |
12 | 12a6499a12b47 |
13 | 62255853711a |
14 | 2a3063b7b423 |
15 | 1428355e3ab7 |
hex | a0dc8e52ce7 |
11054321315047 has 2 divisors, whose sum is σ = 11054321315048. Its totient is φ = 11054321315046.
The previous prime is 11054321315021. The next prime is 11054321315069. The reversal of 11054321315047 is 74051312345011.
11054321315047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11054321315047 - 223 = 11054312926439 is a prime.
It is a super-2 number, since 2×110543213150472 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11054321314997 and 11054321315015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11054321315077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5527160657523 + 5527160657524.
It is an arithmetic number, because the mean of its divisors is an integer number (5527160657524).
Almost surely, 211054321315047 is an apocalyptic number.
11054321315047 is a deficient number, since it is larger than the sum of its proper divisors (1).
11054321315047 is an equidigital number, since it uses as much as digits as its factorization.
11054321315047 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 50400, while the sum is 37.
The spelling of 11054321315047 in words is "eleven trillion, fifty-four billion, three hundred twenty-one million, three hundred fifteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •