Base | Representation |
---|---|
bin | 100111101111111011010… |
… | …011000010111101100010 |
3 | 100200010112100100202021100 |
4 | 213233323103002331202 |
5 | 324223123144311132 |
6 | 5450502035535230 |
7 | 401226422343342 |
oct | 47577323027542 |
9 | 10603470322240 |
10 | 2731520307042 |
11 | 96348200370a |
12 | 38147875a516 |
13 | 16a773048767 |
14 | 962c60aad22 |
15 | 4b0be3ba37c |
hex | 27bfb4c2f62 |
2731520307042 has 12 divisors (see below), whose sum is σ = 5918293998630. Its totient is φ = 910506769008.
The previous prime is 2731520307041. The next prime is 2731520307059. The reversal of 2731520307042 is 2407030251372.
2731520307042 is a `hidden beast` number, since 2 + 7 + 31 + 520 + 30 + 70 + 4 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 2360153165841 + 371367141201 = 1536279^2 + 609399^2 .
It is a super-2 number, since 2×27315203070422 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2731520306988 and 2731520307006.
It is not an unprimeable number, because it can be changed into a prime (2731520307041) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 75875564067 + ... + 75875564102.
Almost surely, 22731520307042 is an apocalyptic number.
2731520307042 is an abundant number, since it is smaller than the sum of its proper divisors (3186773691588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2731520307042 is a wasteful number, since it uses less digits than its factorization.
2731520307042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151751128177 (or 151751128174 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 36.
The spelling of 2731520307042 in words is "two trillion, seven hundred thirty-one billion, five hundred twenty million, three hundred seven thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •