Base | Representation |
---|---|
bin | 10000101001011110001… |
… | …111100100010111001101 |
3 | 11001100222021200112121110 |
4 | 100221132033210113031 |
5 | 122220444331041031 |
6 | 2233322115522233 |
7 | 145440303202056 |
oct | 20513617442715 |
9 | 4040867615543 |
10 | 1144042440141 |
11 | 401205150157 |
12 | 1658815b9379 |
13 | 83b624bb643 |
14 | 3d52c8b572d |
15 | 1eb5c2e2c46 |
hex | 10a5e3e45cd |
1144042440141 has 8 divisors (see below), whose sum is σ = 1533293495680. Its totient is φ = 758743172352.
The previous prime is 1144042440139. The next prime is 1144042440199. The reversal of 1144042440141 is 1410442404411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1144042440141 - 21 = 1144042440139 is a prime.
It is a Duffinian number.
It is a zygodrome in base 6.
It is a junction number, because it is equal to n+sod(n) for n = 1144042440099 and 1144042440108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1144042440241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 987946261 + ... + 987947418.
It is an arithmetic number, because the mean of its divisors is an integer number (191661686960).
Almost surely, 21144042440141 is an apocalyptic number.
It is an amenable number.
1144042440141 is a deficient number, since it is larger than the sum of its proper divisors (389251055539).
1144042440141 is a wasteful number, since it uses less digits than its factorization.
1144042440141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1975893875.
The product of its (nonzero) digits is 8192, while the sum is 30.
Adding to 1144042440141 its reverse (1410442404411), we get a palindrome (2554484844552).
The spelling of 1144042440141 in words is "one trillion, one hundred forty-four billion, forty-two million, four hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •