Base | Representation |
---|---|
bin | 11110110001100001000… |
… | …11100000100111010001 |
3 | 10202002021101120011120010 |
4 | 33120300203200213101 |
5 | 114311001400213214 |
6 | 2125430241305133 |
7 | 136251530356140 |
oct | 17306043404721 |
9 | 3662241504503 |
10 | 1057376569809 |
11 | 37848156502a |
12 | 150b153351a9 |
13 | 7893036b271 |
14 | 3926a719757 |
15 | 1c788a0b659 |
hex | f6308e09d1 |
1057376569809 has 48 divisors (see below), whose sum is σ = 1701590183808. Its totient is φ = 572049402624.
The previous prime is 1057376569807. The next prime is 1057376569829. The reversal of 1057376569809 is 9089656737501.
It is not a de Polignac number, because 1057376569809 - 21 = 1057376569807 is a prime.
It is a super-2 number, since 2×10573765698092 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1057376569809.
It is not an unprimeable number, because it can be changed into a prime (1057376569807) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 12063189 + ... + 12150525.
It is an arithmetic number, because the mean of its divisors is an integer number (35449795496).
Almost surely, 21057376569809 is an apocalyptic number.
1057376569809 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
1057376569809 is a deficient number, since it is larger than the sum of its proper divisors (644213613999).
1057376569809 is a wasteful number, since it uses less digits than its factorization.
1057376569809 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88982 (or 88963 counting only the distinct ones).
The product of its (nonzero) digits is 85730400, while the sum is 66.
The spelling of 1057376569809 in words is "one trillion, fifty-seven billion, three hundred seventy-six million, five hundred sixty-nine thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •