Base | Representation |
---|---|
bin | 110011010001110101… |
… | …0111011011011110101 |
3 | 101112020110102210220210 |
4 | 1212203222323123311 |
5 | 3301011222401401 |
6 | 122331040220033 |
7 | 10645610410443 |
oct | 1464352733365 |
9 | 345213383823 |
10 | 110120122101 |
11 | 42779a35680 |
12 | 1941300a619 |
13 | a4cc367582 |
14 | 5489131b93 |
15 | 2ce79244d6 |
hex | 19a3abb6f5 |
110120122101 has 32 divisors (see below), whose sum is σ = 160557672960. Its totient is φ = 66580113600.
The previous prime is 110120122009. The next prime is 110120122103. The reversal of 110120122101 is 101221021011.
It is not a de Polignac number, because 110120122101 - 29 = 110120121589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110120122103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40320906 + ... + 40323636.
It is an arithmetic number, because the mean of its divisors is an integer number (5017427280).
Almost surely, 2110120122101 is an apocalyptic number.
110120122101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110120122101 is a deficient number, since it is larger than the sum of its proper divisors (50437550859).
110120122101 is a wasteful number, since it uses less digits than its factorization.
110120122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5217.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110120122101 its reverse (101221021011), we get a palindrome (211341143112).
It can be divided in two parts, 110120 and 122101, that added together give a triangular number (232221 = T681).
The spelling of 110120122101 in words is "one hundred ten billion, one hundred twenty million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •