Base | Representation |
---|---|
bin | 1010000011010100100000… |
… | …0111000001010101100011 |
3 | 1110010120120002010101011020 |
4 | 2200311020013001111203 |
5 | 2422034311111341033 |
6 | 35301143103220523 |
7 | 2220330562336035 |
oct | 240651007012543 |
9 | 43116502111136 |
10 | 11052160652643 |
11 | 3581216617300 |
12 | 12a5b962a7743 |
13 | 6222a29c9966 |
14 | 2a2cdac1dc55 |
15 | 14275aa976b3 |
hex | a0d481c1563 |
11052160652643 has 48 divisors (see below), whose sum is σ = 16218794592000. Its totient is φ = 6689543291200.
The previous prime is 11052160652641. The next prime is 11052160652677. The reversal of 11052160652643 is 34625606125011.
It is not a de Polignac number, because 11052160652643 - 21 = 11052160652641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11052160652595 and 11052160652604.
It is not an unprimeable number, because it can be changed into a prime (11052160652641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1674820258 + ... + 1674826856.
It is an arithmetic number, because the mean of its divisors is an integer number (337891554000).
Almost surely, 211052160652643 is an apocalyptic number.
11052160652643 is a deficient number, since it is larger than the sum of its proper divisors (5166633939357).
11052160652643 is a wasteful number, since it uses less digits than its factorization.
11052160652643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11944 (or 11933 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 42.
Adding to 11052160652643 its reverse (34625606125011), we get a palindrome (45677766777654).
The spelling of 11052160652643 in words is "eleven trillion, fifty-two billion, one hundred sixty million, six hundred fifty-two thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •