Base | Representation |
---|---|
bin | 10000110101101001110… |
… | …110111011110011110001 |
3 | 11002121201211120202012022 |
4 | 100311221312323303301 |
5 | 122424241241223212 |
6 | 2243324040441225 |
7 | 146412365340011 |
oct | 20655166736361 |
9 | 4077654522168 |
10 | 1157122211057 |
11 | 40680735a68a |
12 | 168311a79215 |
13 | 85168270367 |
14 | 4000da87c41 |
15 | 20175750772 |
hex | 10d69dbbcf1 |
1157122211057 has 8 divisors (see below), whose sum is σ = 1218443012160. Its totient is φ = 1095843373200.
The previous prime is 1157122211053. The next prime is 1157122211059. The reversal of 1157122211057 is 7501122217511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1157122211057 - 22 = 1157122211053 is a prime.
It is a super-3 number, since 3×11571222110573 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1157122211053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10434194 + ... + 10544507.
It is an arithmetic number, because the mean of its divisors is an integer number (152305376520).
Almost surely, 21157122211057 is an apocalyptic number.
It is an amenable number.
1157122211057 is a deficient number, since it is larger than the sum of its proper divisors (61320801103).
1157122211057 is a wasteful number, since it uses less digits than its factorization.
1157122211057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20981623.
The product of its (nonzero) digits is 9800, while the sum is 35.
Adding to 1157122211057 its reverse (7501122217511), we get a palindrome (8658244428568).
The spelling of 1157122211057 in words is "one trillion, one hundred fifty-seven billion, one hundred twenty-two million, two hundred eleven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •