Base | Representation |
---|---|
bin | 110011010010001110… |
… | …1001111011001111101 |
3 | 101112021101020212211021 |
4 | 1212210131033121331 |
5 | 3301023111423401 |
6 | 122332231024141 |
7 | 10646130461362 |
oct | 1464435173175 |
9 | 345241225737 |
10 | 110133311101 |
11 | 42786423780 |
12 | 1941750b051 |
13 | a502004808 |
14 | 548aba6469 |
15 | 2ce8b7c2a1 |
hex | 19a474f67d |
110133311101 has 4 divisors (see below), whose sum is σ = 120145430304. Its totient is φ = 100121191900.
The previous prime is 110133311069. The next prime is 110133311117. The reversal of 110133311101 is 101113331011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110133311101 - 25 = 110133311069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110133311191) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5006059585 + ... + 5006059606.
It is an arithmetic number, because the mean of its divisors is an integer number (30036357576).
Almost surely, 2110133311101 is an apocalyptic number.
110133311101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110133311101 is a deficient number, since it is larger than the sum of its proper divisors (10012119203).
110133311101 is a wasteful number, since it uses less digits than its factorization.
110133311101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10012119202.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 110133311101 its reverse (101113331011), we get a palindrome (211246642112).
The spelling of 110133311101 in words is "one hundred ten billion, one hundred thirty-three million, three hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •