Base | Representation |
---|---|
bin | 11110110001000100010… |
… | …10100101010111001101 |
3 | 10202001122120022000012110 |
4 | 33120202022211113031 |
5 | 114310003044422022 |
6 | 2125350255054233 |
7 | 136242536360622 |
oct | 17304212452715 |
9 | 3661576260173 |
10 | 1057135154637 |
11 | 378368265261 |
12 | 150a68511379 |
13 | 788c2343253 |
14 | 39246636349 |
15 | 1c77272100c |
hex | f6222a55cd |
1057135154637 has 16 divisors (see below), whose sum is σ = 1494555147072. Its totient is φ = 662354246400.
The previous prime is 1057135154633. The next prime is 1057135154657. The reversal of 1057135154637 is 7364515317501.
1057135154637 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1057135154637 - 22 = 1057135154633 is a prime.
It is a super-2 number, since 2×10571351546372 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1057135154633) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14748943 + ... + 14820444.
It is an arithmetic number, because the mean of its divisors is an integer number (93409696692).
Almost surely, 21057135154637 is an apocalyptic number.
1057135154637 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1057135154637 is a deficient number, since it is larger than the sum of its proper divisors (437419992435).
1057135154637 is a wasteful number, since it uses less digits than its factorization.
1057135154637 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29570108.
The product of its (nonzero) digits is 1323000, while the sum is 48.
The spelling of 1057135154637 in words is "one trillion, fifty-seven billion, one hundred thirty-five million, one hundred fifty-four thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •