Base | Representation |
---|---|
bin | 110010110100101100… |
… | …1000010101100000001 |
3 | 101102201022121002011221 |
4 | 1211221121002230001 |
5 | 3242010420322224 |
6 | 122050031235041 |
7 | 10612435464544 |
oct | 1455131025401 |
9 | 342638532157 |
10 | 109142354689 |
11 | 42318017535 |
12 | 1919b678a81 |
13 | a3a4912a84 |
14 | 53d533085b |
15 | 2c8bb856e4 |
hex | 1969642b01 |
109142354689 has 9 divisors (see below), whose sum is σ = 112787230851. Its totient is φ = 105611722560.
The previous prime is 109142354639. The next prime is 109142354693. The reversal of 109142354689 is 986453241901.
The square root of 109142354689 is 330367.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 5839252225 + 103303102464 = 76415^2 + 321408^2 .
It is not a de Polignac number, because 109142354689 - 213 = 109142346497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109142354639) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 10236049 + ... + 10246705.
It is an arithmetic number, because the mean of its divisors is an integer number (12531914539).
Almost surely, 2109142354689 is an apocalyptic number.
109142354689 is the 330367-th square number.
109142354689 is the 165184-th centered octagonal number.
It is an amenable number.
109142354689 is a deficient number, since it is larger than the sum of its proper divisors (3644876162).
109142354689 is an frugal number, since it uses more digits than its factorization.
109142354689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21376 (or 10688 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 52.
The spelling of 109142354689 in words is "one hundred nine billion, one hundred forty-two million, three hundred fifty-four thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •