Base | Representation |
---|---|
bin | 1010001000100011010110… |
… | …0010101101010010011001 |
3 | 1110110011120011110220121210 |
4 | 2202020311202231102121 |
5 | 2430022401111103130 |
6 | 35410330055453333 |
7 | 2226662136510252 |
oct | 242106542552231 |
9 | 43404504426553 |
10 | 11142043456665 |
11 | 3606350071310 |
12 | 12bb49b987249 |
13 | 62a8c84673b4 |
14 | 2a73c6331b29 |
15 | 144c6b9c45b0 |
hex | a22358ad499 |
11142043456665 has 32 divisors (see below), whose sum is σ = 19448094499200. Its totient is φ = 5402157304320.
The previous prime is 11142043456613. The next prime is 11142043456669. The reversal of 11142043456665 is 56665434024111.
It is not a de Polignac number, because 11142043456665 - 26 = 11142043456601 is a prime.
It is a super-2 number, since 2×111420434566652 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11142043456669) 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 31 ways as a sum of consecutive naturals, for example, 27537141 + ... + 27938829.
It is an arithmetic number, because the mean of its divisors is an integer number (607752953100).
Almost surely, 211142043456665 is an apocalyptic number.
11142043456665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11142043456665 is a deficient number, since it is larger than the sum of its proper divisors (8306051042535).
11142043456665 is a wasteful number, since it uses less digits than its factorization.
11142043456665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569817.
The product of its (nonzero) digits is 2073600, while the sum is 48.
The spelling of 11142043456665 in words is "eleven trillion, one hundred forty-two billion, forty-three million, four hundred fifty-six thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •