Base | Representation |
---|---|
bin | 10000111101111110000… |
… | …111011100111110011001 |
3 | 11010110210011121001100100 |
4 | 100331332013130332121 |
5 | 123101033304120441 |
6 | 2251402113330013 |
7 | 150146566430532 |
oct | 20757607347631 |
9 | 4113704531310 |
10 | 1166052020121 |
11 | 40a579a6a37a |
12 | 169ba4566909 |
13 | 85c5c315c51 |
14 | 40619a2b689 |
15 | 204e96b4cb6 |
hex | 10f7e1dcf99 |
1166052020121 has 24 divisors (see below), whose sum is σ = 1742622153480. Its totient is φ = 750456435456.
The previous prime is 1166052020071. The next prime is 1166052020143. The reversal of 1166052020121 is 1210202506611.
1166052020121 is a `hidden beast` number, since 1 + 1 + 6 + 605 + 20 + 20 + 12 + 1 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 667913907600 + 498138112521 = 817260^2 + 705789^2 .
It is not a de Polignac number, because 1166052020121 - 29 = 1166052019609 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1166052020191) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1561951 + ... + 2184443.
It is an arithmetic number, because the mean of its divisors is an integer number (72609256395).
Almost surely, 21166052020121 is an apocalyptic number.
It is an amenable number.
1166052020121 is a deficient number, since it is larger than the sum of its proper divisors (576570133359).
1166052020121 is a wasteful number, since it uses less digits than its factorization.
1166052020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629705 (or 629702 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
Adding to 1166052020121 its reverse (1210202506611), we get a palindrome (2376254526732).
The spelling of 1166052020121 in words is "one trillion, one hundred sixty-six billion, fifty-two million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •