Base | Representation |
---|---|
bin | 1101000000010… |
… | …01110000110101 |
3 | 21121021102221111 |
4 | 12200021300311 |
5 | 210411420033 |
6 | 14454115021 |
7 | 2463160111 |
oct | 640116065 |
9 | 247242844 |
10 | 109091893 |
11 | 56641399 |
12 | 3064ba71 |
13 | 197a7c21 |
14 | 106ba741 |
15 | 989d7cd |
hex | 6809c35 |
109091893 has 2 divisors, whose sum is σ = 109091894. Its totient is φ = 109091892.
The previous prime is 109091891. The next prime is 109091911. The reversal of 109091893 is 398190901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108014449 + 1077444 = 10393^2 + 1038^2 .
It is an emirp because it is prime and its reverse (398190901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 109091893 - 21 = 109091891 is a prime.
It is a super-2 number, since 2×1090918932 = 23802082236646898, which contains 22 as substring.
Together with 109091891, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109091891) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54545946 + 54545947.
It is an arithmetic number, because the mean of its divisors is an integer number (54545947).
Almost surely, 2109091893 is an apocalyptic number.
It is an amenable number.
109091893 is a deficient number, since it is larger than the sum of its proper divisors (1).
109091893 is an equidigital number, since it uses as much as digits as its factorization.
109091893 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 40.
The square root of 109091893 is about 10444.7064582974. The cubic root of 109091893 is about 477.8198188213.
The spelling of 109091893 in words is "one hundred nine million, ninety-one thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •