Base | Representation |
---|---|
bin | 10100110010100010… |
… | …11111000000000001 |
3 | 1001210212012111101210 |
4 | 22121101133000001 |
5 | 140324311311230 |
6 | 5043312120333 |
7 | 543406415160 |
oct | 123121370001 |
9 | 31725174353 |
10 | 11161432065 |
11 | 4808379123 |
12 | 21b5b360a9 |
13 | 108b4c9b94 |
14 | 77c4d33d7 |
15 | 454d2aeb0 |
hex | 29945f001 |
11161432065 has 32 divisors (see below), whose sum is σ = 21296848896. Its totient is φ = 4880525760.
The previous prime is 11161432063. The next prime is 11161432103. The reversal of 11161432065 is 56023416111.
It is a happy number.
It is not a de Polignac number, because 11161432065 - 21 = 11161432063 is a prime.
It is a super-2 number, since 2×111614320652 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11161432063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2308441 + ... + 2313270.
It is an arithmetic number, because the mean of its divisors is an integer number (665526528).
Almost surely, 211161432065 is an apocalyptic number.
11161432065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11161432065 is a deficient number, since it is larger than the sum of its proper divisors (10135416831).
11161432065 is a wasteful number, since it uses less digits than its factorization.
11161432065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4621749.
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 11161432065 its reverse (56023416111), we get a palindrome (67184848176).
The spelling of 11161432065 in words is "eleven billion, one hundred sixty-one million, four hundred thirty-two thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •