Base | Representation |
---|---|
bin | 110011010100100010… |
… | …1111111000100111101 |
3 | 101112110210122000111020 |
4 | 1212221011333010331 |
5 | 3301203020212424 |
6 | 122344050214353 |
7 | 10651063621143 |
oct | 1465105770475 |
9 | 345423560436 |
10 | 110211100989 |
11 | 42816325440 |
12 | 194395843b9 |
13 | a51516cc32 |
14 | 5497255593 |
15 | 2d008e6079 |
hex | 19a917f13d |
110211100989 has 8 divisors (see below), whose sum is σ = 160307056032. Its totient is φ = 66794606640.
The previous prime is 110211100969. The next prime is 110211100999. The reversal of 110211100989 is 989001112011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110211100989 - 29 = 110211100477 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 3339730333 = 110211100989 / (1 + 1 + 0 + 2 + 1 + 1 + 1 + 0 + 0 + 9 + 8 + 9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110211100969) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1669865134 + ... + 1669865199.
It is an arithmetic number, because the mean of its divisors is an integer number (20038382004).
Almost surely, 2110211100989 is an apocalyptic number.
It is an amenable number.
110211100989 is a deficient number, since it is larger than the sum of its proper divisors (50095955043).
110211100989 is a wasteful number, since it uses less digits than its factorization.
110211100989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3339730347.
The product of its (nonzero) digits is 1296, while the sum is 33.
The spelling of 110211100989 in words is "one hundred ten billion, two hundred eleven million, one hundred thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.390 sec. • engine limits •