Base | Representation |
---|---|
bin | 110010110001101001… |
… | …0010100111000010101 |
3 | 101102110011212102011022 |
4 | 1211203102110320111 |
5 | 3241303210242101 |
6 | 122031532050525 |
7 | 10610053056116 |
oct | 1454322247025 |
9 | 342404772138 |
10 | 109039930901 |
11 | 4227521aa80 |
12 | 19171303a45 |
13 | a389630c95 |
14 | 53c58ac20d |
15 | 2c82ba2a1b |
hex | 1963494e15 |
109039930901 has 4 divisors (see below), whose sum is σ = 118952651904. Its totient is φ = 99127209900.
The previous prime is 109039930861. The next prime is 109039930919.
109039930901 is nontrivially palindromic in base 10.
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 109039930901 - 226 = 108972822037 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 (109039930001) 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, 4956360485 + ... + 4956360506.
It is an arithmetic number, because the mean of its divisors is an integer number (29738162976).
Almost surely, 2109039930901 is an apocalyptic number.
109039930901 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
109039930901 is a deficient number, since it is larger than the sum of its proper divisors (9912721003).
109039930901 is an equidigital number, since it uses as much as digits as its factorization.
109039930901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9912721002.
The product of its (nonzero) digits is 59049, while the sum is 44.
The spelling of 109039930901 in words is "one hundred nine billion, thirty-nine million, nine hundred thirty thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •