Base | Representation |
---|---|
bin | 111100001000001101110… |
… | …101011110110101011000 |
3 | 112122000101112102002010021 |
4 | 330020031311132311120 |
5 | 1020144304102144423 |
6 | 12442113232000224 |
7 | 604345403062153 |
oct | 74101565366530 |
9 | 15560345362107 |
10 | 4131990662488 |
11 | 135340500aa07 |
12 | 568983390074 |
13 | 23c850228460 |
14 | 103dbcd52c9a |
15 | 7273898995d |
hex | 3c20dd5ed58 |
4131990662488 has 128 divisors (see below), whose sum is σ = 8956071936000. Its totient is φ = 1770188359680.
The previous prime is 4131990662467. The next prime is 4131990662561. The reversal of 4131990662488 is 8842660991314.
It is a happy number.
It is a super-2 number, since 2×41319906624882 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 128342473 + ... + 128374663.
It is an arithmetic number, because the mean of its divisors is an integer number (69969312000).
Almost surely, 24131990662488 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 4131990662488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4478035968000).
4131990662488 is an abundant number, since it is smaller than the sum of its proper divisors (4824081273512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4131990662488 is a wasteful number, since it uses less digits than its factorization.
4131990662488 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33225 (or 33221 counting only the distinct ones).
The product of its (nonzero) digits is 17915904, while the sum is 61.
The spelling of 4131990662488 in words is "four trillion, one hundred thirty-one billion, nine hundred ninety million, six hundred sixty-two thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •