Base | Representation |
---|---|
bin | 111100010000001101111… |
… | …000010011001111111000 |
3 | 112122211120020021111211101 |
4 | 330100031320103033320 |
5 | 1020314402310223211 |
6 | 12450053511541144 |
7 | 605101315435534 |
oct | 74201570231770 |
9 | 15584506244741 |
10 | 4140581336056 |
11 | 1357013246130 |
12 | 56a58038a7b4 |
13 | 2405bbc50059 |
14 | 104595c56bc4 |
15 | 72a8cc5e5c1 |
hex | 3c40de133f8 |
4140581336056 has 64 divisors (see below), whose sum is σ = 8630230341600. Its totient is φ = 1846344614400.
The previous prime is 4140581336041. The next prime is 4140581336207. The reversal of 4140581336056 is 6506331850414.
4140581336056 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 4140581335997 and 4140581336015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41277610 + ... + 41377798.
Almost surely, 24140581336056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4140581336056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4315115170800).
4140581336056 is an abundant number, since it is smaller than the sum of its proper divisors (4489649005544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4140581336056 is a wasteful number, since it uses less digits than its factorization.
4140581336056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109120 (or 109116 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 46.
The spelling of 4140581336056 in words is "four trillion, one hundred forty billion, five hundred eighty-one million, three hundred thirty-six thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •