Base | Representation |
---|---|
bin | 110011101011110001… |
… | …0000011000001001101 |
3 | 101121111002122210220020 |
4 | 1213113202003001031 |
5 | 3304301443142401 |
6 | 122553241212353 |
7 | 11006304132312 |
oct | 1472742030115 |
9 | 347432583806 |
10 | 110990209101 |
11 | 43086096942 |
12 | 196164910b9 |
13 | a60a6b9755 |
14 | 552c902d09 |
15 | 2d48ee2d36 |
hex | 19d788304d |
110990209101 has 4 divisors (see below), whose sum is σ = 147986945472. Its totient is φ = 73993472732.
The previous prime is 110990209067. The next prime is 110990209153. The reversal of 110990209101 is 101902099011.
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 110990209101 - 217 = 110990078029 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110990209301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18498368181 + ... + 18498368186.
It is an arithmetic number, because the mean of its divisors is an integer number (36996736368).
Almost surely, 2110990209101 is an apocalyptic number.
It is an amenable number.
110990209101 is a deficient number, since it is larger than the sum of its proper divisors (36996736371).
110990209101 is an equidigital number, since it uses as much as digits as its factorization.
110990209101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36996736370.
The product of its (nonzero) digits is 1458, while the sum is 33.
The spelling of 110990209101 in words is "one hundred ten billion, nine hundred ninety million, two hundred nine thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •