Base | Representation |
---|---|
bin | 1010000110111000110011… |
… | …1010001011100011110001 |
3 | 1110100102202001102011222110 |
4 | 2201232030322023203301 |
5 | 2424040313240103224 |
6 | 35345240151555533 |
7 | 2224630341150501 |
oct | 241561472134361 |
9 | 43312661364873 |
10 | 11113444456689 |
11 | 35a520473a343 |
12 | 12b5a3a08bba9 |
13 | 627cbb410cc3 |
14 | 2a5c71db9a01 |
15 | 144145d8b929 |
hex | a1b8ce8b8f1 |
11113444456689 has 16 divisors (see below), whose sum is σ = 14973691963328. Its totient is φ = 7331110612992.
The previous prime is 11113444456679. The next prime is 11113444456693. The reversal of 11113444456689 is 98665444431111.
It is a happy number.
11113444456689 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 11113444456689 - 25 = 11113444456657 is a prime.
It is a super-2 number, since 2×111134444566892 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a plaindrome in base 10.
It is not an unprimeable number, because it can be changed into a prime (11113444456679) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2377792 + ... + 5280225.
It is an arithmetic number, because the mean of its divisors is an integer number (935855747708).
Almost surely, 211113444456689 is an apocalyptic number.
It is an amenable number.
11113444456689 is a deficient number, since it is larger than the sum of its proper divisors (3860247506639).
11113444456689 is an equidigital number, since it uses as much as digits as its factorization.
11113444456689 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7663104.
The product of its digits is 9953280, while the sum is 57.
The spelling of 11113444456689 in words is "eleven trillion, one hundred thirteen billion, four hundred forty-four million, four hundred fifty-six thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •