Base | Representation |
---|---|
bin | 110011000101010000… |
… | …0111101000010110001 |
3 | 101111011001021200200011 |
4 | 1212022200331002301 |
5 | 3244130201424344 |
6 | 122221122254521 |
7 | 10632264161014 |
oct | 1461240750261 |
9 | 344131250604 |
10 | 109698076849 |
11 | 42582782849 |
12 | 193157b7441 |
13 | a462aa795a |
14 | 544906d37b |
15 | 2cc0858d34 |
hex | 198a83d0b1 |
109698076849 has 3 divisors (see below), whose sum is σ = 109698408057. Its totient is φ = 109697745642.
The previous prime is 109698076847. The next prime is 109698076879. The reversal of 109698076849 is 948670896901.
The square root of 109698076849 is 331207.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 109698076849 - 21 = 109698076847 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109698076847) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 165604 + ... + 496810.
It is an arithmetic number, because the mean of its divisors is an integer number (36566136019).
Almost surely, 2109698076849 is an apocalyptic number.
109698076849 is the 331207-th square number.
109698076849 is the 165604-th centered octagonal number.
It is an amenable number.
109698076849 is a deficient number, since it is larger than the sum of its proper divisors (331208).
109698076849 is an frugal number, since it uses more digits than its factorization.
109698076849 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 662414 (or 331207 counting only the distinct ones).
The product of its (nonzero) digits is 47029248, while the sum is 67.
The spelling of 109698076849 in words is "one hundred nine billion, six hundred ninety-eight million, seventy-six thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •