Base | Representation |
---|---|
bin | 10000100101101111111… |
… | …011001001110010110111 |
3 | 11000222122122010101012010 |
4 | 100211233323021302313 |
5 | 122134302243023111 |
6 | 2231421245455303 |
7 | 145236233024640 |
oct | 20455773116267 |
9 | 4028578111163 |
10 | 1140044111031 |
11 | 3aa5431a8331 |
12 | 164b46571533 |
13 | 83676033627 |
14 | 3d26d8786c7 |
15 | 1e9c629caa6 |
hex | 1096fec9cb7 |
1140044111031 has 16 divisors (see below), whose sum is σ = 1742868748544. Its totient is φ = 649331774784.
The previous prime is 1140044111023. The next prime is 1140044111033. The reversal of 1140044111031 is 1301114400411.
It is not a de Polignac number, because 1140044111031 - 23 = 1140044111023 is a prime.
It is a super-2 number, since 2×11400441110312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1140044110989 and 1140044111007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140044111033) 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, 88410190 + ... + 88423083.
It is an arithmetic number, because the mean of its divisors is an integer number (108929296784).
Almost surely, 21140044111031 is an apocalyptic number.
1140044111031 is a deficient number, since it is larger than the sum of its proper divisors (602824637513).
1140044111031 is a wasteful number, since it uses less digits than its factorization.
1140044111031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176833590.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 1140044111031 its reverse (1301114400411), we get a palindrome (2441158511442).
The spelling of 1140044111031 in words is "one trillion, one hundred forty billion, forty-four million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •