Base | Representation |
---|---|
bin | 10100110000011110… |
… | …00000101111100111 |
3 | 1001202122102012012100 |
4 | 22120033000233213 |
5 | 140310331203011 |
6 | 5041450423143 |
7 | 543105331152 |
oct | 123017005747 |
9 | 31678365170 |
10 | 11144006631 |
11 | 47a955713a |
12 | 21b0131ab3 |
13 | 1087a08584 |
14 | 77a078c99 |
15 | 453537d56 |
hex | 2983c0be7 |
11144006631 has 24 divisors (see below), whose sum is σ = 16209801920. Its totient is φ = 7377371136.
The previous prime is 11144006623. The next prime is 11144006633. The reversal of 11144006631 is 13660044111.
11144006631 is a `hidden beast` number, since 11 + 14 + 4 + 0 + 0 + 6 + 631 = 666.
11144006631 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 11144006631 - 23 = 11144006623 is a prime.
It is a super-2 number, since 2×111440066312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11144006595 and 11144006604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11144006633) 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 23 ways as a sum of consecutive naturals, for example, 996690 + ... + 1007808.
Almost surely, 211144006631 is an apocalyptic number.
11144006631 is a deficient number, since it is larger than the sum of its proper divisors (5065795289).
11144006631 is a wasteful number, since it uses less digits than its factorization.
11144006631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11895 (or 11892 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The spelling of 11144006631 in words is "eleven billion, one hundred forty-four million, six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •