Base | Representation |
---|---|
bin | 110010110101001111… |
… | …1100111100111011001 |
3 | 101102202121102001020121 |
4 | 1211222133213213121 |
5 | 3242030134343100 |
6 | 122051531553241 |
7 | 10613051652364 |
oct | 1455237474731 |
9 | 342677361217 |
10 | 109160856025 |
11 | 423275038a1 |
12 | 191a58bb821 |
13 | a3a86c0000 |
14 | 53d79890db |
15 | 2c8d5dc51a |
hex | 196a7e79d9 |
109160856025 has 135 divisors (see below), whose sum is σ = 162839419841. Its totient is φ = 72570600960.
The previous prime is 109160856001. The next prime is 109160856031. The reversal of 109160856025 is 520658061901.
The square root of 109160856025 is 330395.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 22 ways, for example, as 71513991241 + 37646864784 = 267421^2 + 194028^2 .
It is not a de Polignac number, because 109160856025 - 213 = 109160847833 is a prime.
It is a super-2 number, since 2×1091608560252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 134 ways as a sum of consecutive naturals, for example, 4746124164 + ... + 4746124186.
Almost surely, 2109160856025 is an apocalyptic number.
109160856025 is the 330395-th square number.
109160856025 is the 165198-th centered octagonal number.
It is an amenable number.
109160856025 is a deficient number, since it is larger than the sum of its proper divisors (53678563816).
109160856025 is an frugal number, since it uses more digits than its factorization.
109160856025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142 (or 58 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 43.
The spelling of 109160856025 in words is "one hundred nine billion, one hundred sixty million, eight hundred fifty-six thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •