Base | Representation |
---|---|
bin | 110011001011000001… |
… | …0110000000001001001 |
3 | 101111122112012212211111 |
4 | 1212112002300001021 |
5 | 3300024210021034 |
6 | 122252231530321 |
7 | 10640133134302 |
oct | 1462602600111 |
9 | 344575185744 |
10 | 109891485769 |
11 | 4267197382a |
12 | 1936a5299a1 |
13 | a493b94bc0 |
14 | 5466a177a9 |
15 | 2cd2810364 |
hex | 19960b0049 |
109891485769 has 8 divisors (see below), whose sum is σ = 118364992200. Its totient is φ = 101420881536.
The previous prime is 109891485757. The next prime is 109891485853. The reversal of 109891485769 is 967584198901.
It can be written as a sum of positive squares in 4 ways, for example, as 327175744 + 109564310025 = 18088^2 + 331005^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 109891485769 - 211 = 109891483721 is a prime.
It is a super-2 number, since 2×1098914857692 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (109891483769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 646582 + ... + 798655.
It is an arithmetic number, because the mean of its divisors is an integer number (14795624025).
Almost surely, 2109891485769 is an apocalyptic number.
It is an amenable number.
109891485769 is a deficient number, since it is larger than the sum of its proper divisors (8473506431).
109891485769 is a wasteful number, since it uses less digits than its factorization.
109891485769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1451099.
The product of its (nonzero) digits is 39191040, while the sum is 67.
The spelling of 109891485769 in words is "one hundred nine billion, eight hundred ninety-one million, four hundred eighty-five thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •