Base | Representation |
---|---|
bin | 10101011101100010… |
… | …00111010011101011 |
3 | 1002201222202112120110 |
4 | 22232301013103223 |
5 | 142044120421123 |
6 | 5143153225403 |
7 | 555345524256 |
oct | 125661072353 |
9 | 32658675513 |
10 | 11522045163 |
11 | 4982992082 |
12 | 2296862263 |
13 | 111812aa05 |
14 | 7b436409d |
15 | 47680e493 |
hex | 2aec474eb |
11522045163 has 4 divisors (see below), whose sum is σ = 15362726888. Its totient is φ = 7681363440.
The previous prime is 11522045111. The next prime is 11522045173. The reversal of 11522045163 is 36154022511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 36154022511 = 3 ⋅12051340837.
It is not a de Polignac number, because 11522045163 - 26 = 11522045099 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11522045163.
It is not an unprimeable number, because it can be changed into a prime (11522045173) 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 in 3 ways as a sum of consecutive naturals, for example, 1920340858 + ... + 1920340863.
It is an arithmetic number, because the mean of its divisors is an integer number (3840681722).
Almost surely, 211522045163 is an apocalyptic number.
11522045163 is a deficient number, since it is larger than the sum of its proper divisors (3840681725).
11522045163 is an equidigital number, since it uses as much as digits as its factorization.
11522045163 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3840681724.
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 11522045163 its reverse (36154022511), we get a palindrome (47676067674).
The spelling of 11522045163 in words is "eleven billion, five hundred twenty-two million, forty-five thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •