Base | Representation |
---|---|
bin | 100000101110100011011101… |
… | …000100111010010010111100 |
3 | 200212122012122211112001200210 |
4 | 200232203131010322102330 |
5 | 122331224231141410034 |
6 | 1230043330252352420 |
7 | 42214036305234432 |
oct | 4056433504722274 |
9 | 625565584461623 |
10 | 143936653075644 |
11 | 41954212270a70 |
12 | 14187a79a75710 |
13 | 624122554a430 |
14 | 27787dd464d52 |
15 | 11991c8ec28e9 |
hex | 82e8dd13a4bc |
143936653075644 has 48 divisors (see below), whose sum is σ = 394567608435840. Its totient is φ = 40262000859840.
The previous prime is 143936653075643. The next prime is 143936653075679. The reversal of 143936653075644 is 446570356639341.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143936653075643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41939582514 + ... + 41939585945.
It is an arithmetic number, because the mean of its divisors is an integer number (8220158509080).
Almost surely, 2143936653075644 is an apocalyptic number.
It is an amenable number.
143936653075644 is an abundant number, since it is smaller than the sum of its proper divisors (250630955360196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143936653075644 is a wasteful number, since it uses less digits than its factorization.
143936653075644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83879168490 (or 83879168488 counting only the distinct ones).
The product of its (nonzero) digits is 587865600, while the sum is 66.
The spelling of 143936653075644 in words is "one hundred forty-three trillion, nine hundred thirty-six billion, six hundred fifty-three million, seventy-five thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •