Base | Representation |
---|---|
bin | 100111101111011111000… |
… | …100011111101001100110 |
3 | 100200002022100020120011120 |
4 | 213233133010133221212 |
5 | 324221140430332332 |
6 | 5450343041314410 |
7 | 401211612120300 |
oct | 47573704375146 |
9 | 10602270216146 |
10 | 2731046730342 |
11 | 963259754507 |
12 | 381366035a06 |
13 | 16a6c8bb5668 |
14 | 9627d232970 |
15 | 4b092a2132c |
hex | 27bdf11fa66 |
2731046730342 has 192 divisors, whose sum is σ = 6595607741184. Its totient is φ = 751142461440.
The previous prime is 2731046730289. The next prime is 2731046730359. The reversal of 2731046730342 is 2430376401372.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 2731046730294 and 2731046730303.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1217585473 + ... + 1217587715.
It is an arithmetic number, because the mean of its divisors is an integer number (34352123652).
Almost surely, 22731046730342 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2731046730342, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3297803870592).
2731046730342 is an abundant number, since it is smaller than the sum of its proper divisors (3864561010842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2731046730342 is a wasteful number, since it uses less digits than its factorization.
2731046730342 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3603 (or 3596 counting only the distinct ones).
The product of its (nonzero) digits is 508032, while the sum is 42.
The spelling of 2731046730342 in words is "two trillion, seven hundred thirty-one billion, forty-six million, seven hundred thirty thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •