Base | Representation |
---|---|
bin | 101001000001001000… |
… | …111011110011111101 |
3 | 11012200101210112211012 |
4 | 221001020323303331 |
5 | 1210144342043031 |
6 | 32122144205005 |
7 | 3116262235424 |
oct | 510110736375 |
9 | 135611715735 |
10 | 44042534141 |
11 | 17750953851 |
12 | 8651909765 |
13 | 41cb7470b8 |
14 | 21bb4342bb |
15 | 122b85eb2b |
hex | a4123bcfd |
44042534141 has 8 divisors (see below), whose sum is σ = 44233611840. Its totient is φ = 43851635872.
The previous prime is 44042534113. The next prime is 44042534143. The reversal of 44042534141 is 14143524044.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 44042534141 - 234 = 26862664957 is a prime.
It is a super-2 number, since 2×440425341412 (a number of 22 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 = 44042534098 and 44042534107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44042534143) 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 7 ways as a sum of consecutive naturals, for example, 459350 + ... + 546888.
It is an arithmetic number, because the mean of its divisors is an integer number (5529201480).
Almost surely, 244042534141 is an apocalyptic number.
It is an amenable number.
44042534141 is a deficient number, since it is larger than the sum of its proper divisors (191077699).
44042534141 is a wasteful number, since it uses less digits than its factorization.
44042534141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89715.
The product of its (nonzero) digits is 30720, while the sum is 32.
The spelling of 44042534141 in words is "forty-four billion, forty-two million, five hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •