Base | Representation |
---|---|
bin | 10101010110100000… |
… | …10011111001100101 |
3 | 1002120212212112200102 |
4 | 22223100103321211 |
5 | 141434024124331 |
6 | 5133250153445 |
7 | 554031602300 |
oct | 125320237145 |
9 | 32525775612 |
10 | 11463114341 |
11 | 49526a1518 |
12 | 227ab82885 |
13 | 1108b665c3 |
14 | 7aa5c3b37 |
15 | 47156d4cb |
hex | 2ab413e65 |
11463114341 has 12 divisors (see below), whose sum is σ = 13339467180. Its totient is φ = 9821972160.
The previous prime is 11463114253. The next prime is 11463114347. The reversal of 11463114341 is 14341136411.
11463114341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 3803188900 + 7659925441 = 61670^2 + 87521^2 .
It is not a de Polignac number, because 11463114341 - 222 = 11458920037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11463114347) 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 11 ways as a sum of consecutive naturals, for example, 99305 + ... + 181073.
It is an arithmetic number, because the mean of its divisors is an integer number (1111622265).
Almost surely, 211463114341 is an apocalyptic number.
It is an amenable number.
11463114341 is a deficient number, since it is larger than the sum of its proper divisors (1876352839).
11463114341 is an equidigital number, since it uses as much as digits as its factorization.
11463114341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84644 (or 84637 counting only the distinct ones).
The product of its digits is 3456, while the sum is 29.
The spelling of 11463114341 in words is "eleven billion, four hundred sixty-three million, one hundred fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •