Base | Representation |
---|---|
bin | 10100100111000110… |
… | …10011101100101001 |
3 | 1001120011120122111120 |
4 | 22103203103230221 |
5 | 140130223103230 |
6 | 5030002445453 |
7 | 541132461060 |
oct | 122343235451 |
9 | 31504518446 |
10 | 11065441065 |
11 | 4769175718 |
12 | 2189963889 |
13 | 107465b083 |
14 | 76d8671d7 |
15 | 44b6b9310 |
hex | 2938d3b29 |
11065441065 has 32 divisors (see below), whose sum is σ = 21298897920. Its totient is φ = 4792250304.
The previous prime is 11065441043. The next prime is 11065441067. The reversal of 11065441065 is 56014456011.
11065441065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11065441065 - 27 = 11065440937 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11065441067) 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 31 ways as a sum of consecutive naturals, for example, 2771299 + ... + 2775288.
It is an arithmetic number, because the mean of its divisors is an integer number (665590560).
Almost surely, 211065441065 is an apocalyptic number.
11065441065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11065441065 is a deficient number, since it is larger than the sum of its proper divisors (10233456855).
11065441065 is a wasteful number, since it uses less digits than its factorization.
11065441065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5546621.
The product of its (nonzero) digits is 14400, while the sum is 33.
Adding to 11065441065 its reverse (56014456011), we get a palindrome (67079897076).
The spelling of 11065441065 in words is "eleven billion, sixty-five million, four hundred forty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •