Base | Representation |
---|---|
bin | 10101010100001111… |
… | …11001011001100111 |
3 | 1002112120011010000200 |
4 | 22222013321121213 |
5 | 141414144201211 |
6 | 5131331241543 |
7 | 553411340445 |
oct | 125207713147 |
9 | 32476133020 |
10 | 11444131431 |
11 | 4942a06367 |
12 | 22747492b3 |
13 | 1104c4b105 |
14 | 7a7c81b95 |
15 | 46ea6db56 |
hex | 2aa1f9667 |
11444131431 has 6 divisors (see below), whose sum is σ = 16530412080. Its totient is φ = 7629420948.
The previous prime is 11444131423. The next prime is 11444131507. The reversal of 11444131431 is 13413144411.
It is not a de Polignac number, because 11444131431 - 23 = 11444131423 is a prime.
It is a super-2 number, since 2×114441314312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11444131395 and 11444131404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11445131431) 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 5 ways as a sum of consecutive naturals, for example, 635785071 + ... + 635785088.
It is an arithmetic number, because the mean of its divisors is an integer number (2755068680).
Almost surely, 211444131431 is an apocalyptic number.
11444131431 is a deficient number, since it is larger than the sum of its proper divisors (5086280649).
11444131431 is a wasteful number, since it uses less digits than its factorization.
11444131431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1271570165 (or 1271570162 counting only the distinct ones).
The product of its digits is 2304, while the sum is 27.
Adding to 11444131431 its reverse (13413144411), we get a palindrome (24857275842).
The spelling of 11444131431 in words is "eleven billion, four hundred forty-four million, one hundred thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •