Base | Representation |
---|---|
bin | 10100001001010111010001… |
… | …11001101011001011101111 |
3 | 12210212020201111110121221010 |
4 | 22010223220321223023233 |
5 | 21301321401212433033 |
6 | 234120052203440303 |
7 | 12221504550526353 |
oct | 1204535071531357 |
9 | 183766644417833 |
10 | 44302200124143 |
11 | 13130504017855 |
12 | 4b76091226093 |
13 | 1b948aac67ab0 |
14 | ad2348c2b463 |
15 | 51c6065c9863 |
hex | 284ae8e6b2ef |
44302200124143 has 16 divisors (see below), whose sum is σ = 63613545289056. Its totient is φ = 27262836787200.
The previous prime is 44302200124111. The next prime is 44302200124199. The reversal of 44302200124143 is 34142100220344.
It is not a de Polignac number, because 44302200124143 - 25 = 44302200124111 is a prime.
It is a super-2 number, since 2×443022001241432 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 44302200124143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44302200104143) 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, 26681371 + ... + 28293107.
It is an arithmetic number, because the mean of its divisors is an integer number (3975846580566).
Almost surely, 244302200124143 is an apocalyptic number.
44302200124143 is a deficient number, since it is larger than the sum of its proper divisors (19311345164913).
44302200124143 is a wasteful number, since it uses less digits than its factorization.
44302200124143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2316554.
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 44302200124143 its reverse (34142100220344), we get a palindrome (78444300344487).
The spelling of 44302200124143 in words is "forty-four trillion, three hundred two billion, two hundred million, one hundred twenty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •