Base | Representation |
---|---|
bin | 10001000010101100010… |
… | …110001110111100101001 |
3 | 11010221212112210220120202 |
4 | 101002230112032330221 |
5 | 123141424342122212 |
6 | 2254001210001545 |
7 | 150416336654324 |
oct | 21025426167451 |
9 | 4127775726522 |
10 | 1171122614057 |
11 | 411741203680 |
12 | 16ab7a7162b5 |
13 | 865899907a6 |
14 | 4097b2277bb |
15 | 206e49130c2 |
hex | 110ac58ef29 |
1171122614057 has 16 divisors (see below), whose sum is σ = 1282079593152. Its totient is φ = 1060920760320.
The previous prime is 1171122613987. The next prime is 1171122614059. The reversal of 1171122614057 is 7504162211711.
It is a happy number.
It is not a de Polignac number, because 1171122614057 - 212 = 1171122609961 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1171122614057.
It is not an unprimeable number, because it can be changed into a prime (1171122614059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3409493 + ... + 3737229.
It is an arithmetic number, because the mean of its divisors is an integer number (80129974572).
Almost surely, 21171122614057 is an apocalyptic number.
It is an amenable number.
1171122614057 is a deficient number, since it is larger than the sum of its proper divisors (110956979095).
1171122614057 is a wasteful number, since it uses less digits than its factorization.
1171122614057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328888.
The product of its (nonzero) digits is 23520, while the sum is 38.
Adding to 1171122614057 its reverse (7504162211711), we get a palindrome (8675284825768).
The spelling of 1171122614057 in words is "one trillion, one hundred seventy-one billion, one hundred twenty-two million, six hundred fourteen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •