Base | Representation |
---|---|
bin | 10011101100100010100110… |
… | …01100110000011111011100 |
3 | 12200100120110000120211022002 |
4 | 21312101103030300133130 |
5 | 21134110130043104030 |
6 | 232041104251141432 |
7 | 12060114631114241 |
oct | 1166212314603734 |
9 | 180316400524262 |
10 | 43311846066140 |
11 | 128894a5a6a953 |
12 | 4a36161744878 |
13 | 1b2239c212452 |
14 | a9a4399015c8 |
15 | 501991ad5245 |
hex | 2764533307dc |
43311846066140 has 48 divisors (see below), whose sum is σ = 93414017243232. Its totient is φ = 16856339740416.
The previous prime is 43311846066109. The next prime is 43311846066143. The reversal of 43311846066140 is 4166064811334.
43311846066140 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43311846066143) 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, 101146367 + ... + 101573673.
It is an arithmetic number, because the mean of its divisors is an integer number (1946125359234).
Almost surely, 243311846066140 is an apocalyptic number.
It is an amenable number.
43311846066140 is an abundant number, since it is smaller than the sum of its proper divisors (50102171177092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43311846066140 is a wasteful number, since it uses less digits than its factorization.
43311846066140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564326 (or 564324 counting only the distinct ones).
The product of its (nonzero) digits is 995328, while the sum is 47.
The spelling of 43311846066140 in words is "forty-three trillion, three hundred eleven billion, eight hundred forty-six million, sixty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •