Base | Representation |
---|---|
bin | 110011001010111110… |
… | …1100010110100011101 |
3 | 101111122102122112201002 |
4 | 1212111331202310131 |
5 | 3300023332332424 |
6 | 122252142400045 |
7 | 10640115421325 |
oct | 1462575426435 |
9 | 344572575632 |
10 | 109890120989 |
11 | 42671121410 |
12 | 19369b90025 |
13 | a49380793c |
14 | 5466780285 |
15 | 2cd2640cae |
hex | 1995f62d1d |
109890120989 has 4 divisors (see below), whose sum is σ = 119880132000. Its totient is φ = 99900109980.
The previous prime is 109890120983. The next prime is 109890121013. The reversal of 109890120989 is 989021098901.
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, and also an emirpimes, since its reverse is a distinct semiprime: 989021098901 = 11 ⋅89911008991.
It is not a de Polignac number, because 109890120989 - 212 = 109890116893 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 (109890120983) 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, 4995005489 + ... + 4995005510.
It is an arithmetic number, because the mean of its divisors is an integer number (29970033000).
Almost surely, 2109890120989 is an apocalyptic number.
It is an amenable number.
109890120989 is a deficient number, since it is larger than the sum of its proper divisors (9990011011).
109890120989 is an equidigital number, since it uses as much as digits as its factorization.
109890120989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9990011010.
The product of its (nonzero) digits is 839808, while the sum is 56.
It can be divided in two parts, 109 and 890120989, that added together give a palindrome (890121098).
The spelling of 109890120989 in words is "one hundred nine billion, eight hundred ninety million, one hundred twenty thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •