Base | Representation |
---|---|
bin | 110010110011011011… |
… | …1011110011010001111 |
3 | 101102121100220021201111 |
4 | 1211212313132122033 |
5 | 3241414100012121 |
6 | 122041515352451 |
7 | 10611412464256 |
oct | 1454667363217 |
9 | 342540807644 |
10 | 109100000911 |
11 | 422a6119510 |
12 | 19189452727 |
13 | a398c03a75 |
14 | 53cd86779d |
15 | 2c880bb2e1 |
hex | 1966dde68f |
109100000911 has 8 divisors (see below), whose sum is σ = 119441738448. Its totient is φ = 98828856000.
The previous prime is 109100000903. The next prime is 109100000959. The reversal of 109100000911 is 119000001901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 109100000911 - 23 = 109100000903 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 (109100001911) 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 7 ways as a sum of consecutive naturals, for example, 17644920 + ... + 17651101.
It is an arithmetic number, because the mean of its divisors is an integer number (14930217306).
Almost surely, 2109100000911 is an apocalyptic number.
109100000911 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
109100000911 is a deficient number, since it is larger than the sum of its proper divisors (10341737537).
109100000911 is a wasteful number, since it uses less digits than its factorization.
109100000911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35296313.
The product of its (nonzero) digits is 81, while the sum is 22.
Multiplying 109100000911 by its sum of digits (22), we get a palindrome (2400200020042).
The spelling of 109100000911 in words is "one hundred nine billion, one hundred million, nine hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •