Base | Representation |
---|---|
bin | 10001011110101000010… |
… | …101100110011001011000 |
3 | 11020211022010101121021020 |
4 | 101132220111212121120 |
5 | 124134343222011133 |
6 | 2315441552242440 |
7 | 152530606324236 |
oct | 21365025463130 |
9 | 4224263347236 |
10 | 1201120110168 |
11 | 423434a97480 |
12 | 174950840420 |
13 | 8935a689ca4 |
14 | 421c51bd956 |
15 | 2139d1e50b3 |
hex | 117a8566658 |
1201120110168 has 64 divisors (see below), whose sum is σ = 3305835244800. Its totient is φ = 360636554880.
The previous prime is 1201120110167. The next prime is 1201120110283. The reversal of 1201120110168 is 8610110211021.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201120110167) 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, 20841396 + ... + 20898947.
It is an arithmetic number, because the mean of its divisors is an integer number (51653675700).
Almost surely, 21201120110168 is an apocalyptic number.
It is an amenable number.
1201120110168 is an abundant number, since it is smaller than the sum of its proper divisors (2104715134632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201120110168 is a wasteful number, since it uses less digits than its factorization.
1201120110168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41740472 (or 41740468 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 24.
Adding to 1201120110168 its reverse (8610110211021), we get a palindrome (9811230321189).
The spelling of 1201120110168 in words is "one trillion, two hundred one billion, one hundred twenty million, one hundred ten thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •