Base | Representation |
---|---|
bin | 1010001111101011111011… |
… | …0111110010100001111111 |
3 | 1110212212220210112221202121 |
4 | 2203322332313302201333 |
5 | 2434024403233433142 |
6 | 35542515552103411 |
7 | 2241561310543411 |
oct | 243727667624177 |
9 | 43785823487677 |
10 | 11264606546047 |
11 | 3653324800418 |
12 | 131b1a5b34b67 |
13 | 63932b6700aa |
14 | 2ad2d1c2c9b1 |
15 | 1480419b8c67 |
hex | a3ebedf287f |
11264606546047 has 8 divisors (see below), whose sum is σ = 11267535064032. Its totient is φ = 11261678383200.
The previous prime is 11264606546029. The next prime is 11264606546051. The reversal of 11264606546047 is 74064560646211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11264606546047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11264606545985 and 11264606546003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11264606546027) 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 7 ways as a sum of consecutive naturals, for example, 70469022 + ... + 70628692.
It is an arithmetic number, because the mean of its divisors is an integer number (1408441883004).
Almost surely, 211264606546047 is an apocalyptic number.
11264606546047 is a deficient number, since it is larger than the sum of its proper divisors (2928517985).
11264606546047 is a wasteful number, since it uses less digits than its factorization.
11264606546047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177569.
The product of its (nonzero) digits is 5806080, while the sum is 52.
The spelling of 11264606546047 in words is "eleven trillion, two hundred sixty-four billion, six hundred six million, five hundred forty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •