Base | Representation |
---|---|
bin | 11110110001011101000… |
… | …01111001011000111011 |
3 | 10202002012000121221112220 |
4 | 33120232201321120323 |
5 | 114310414200430241 |
6 | 2125423025135123 |
7 | 136250635514136 |
oct | 17305641713073 |
9 | 3662160557486 |
10 | 1057342592571 |
11 | 378464368471 |
12 | 150b05a8a4a3 |
13 | 78926302ba5 |
14 | 39265dd321d |
15 | 1c785a49166 |
hex | f62e87963b |
1057342592571 has 32 divisors (see below), whose sum is σ = 1461555677760. Its totient is φ = 679118598144.
The previous prime is 1057342592543. The next prime is 1057342592573. The reversal of 1057342592571 is 1752952437501.
It is not a de Polignac number, because 1057342592571 - 27 = 1057342592443 is a prime.
It is a super-2 number, since 2×10573425925712 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1057342592573) 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 31 ways as a sum of consecutive naturals, for example, 131883555 + ... + 131891571.
It is an arithmetic number, because the mean of its divisors is an integer number (45673614930).
Almost surely, 21057342592571 is an apocalyptic number.
1057342592571 is a deficient number, since it is larger than the sum of its proper divisors (404213085189).
1057342592571 is a wasteful number, since it uses less digits than its factorization.
1057342592571 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11135.
The product of its (nonzero) digits is 2646000, while the sum is 51.
The spelling of 1057342592571 in words is "one trillion, fifty-seven billion, three hundred forty-two million, five hundred ninety-two thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •