Base | Representation |
---|---|
bin | 110010001011011011… |
… | …1110011100011010001 |
3 | 101022010211112000102001 |
4 | 1210112313303203101 |
5 | 3231142011111400 |
6 | 121300413554001 |
7 | 10533225060400 |
oct | 1442667634321 |
9 | 338124460361 |
10 | 107757910225 |
11 | 41777592959 |
12 | 18a73aa5901 |
13 | a213b4c774 |
14 | 530350b637 |
15 | 2c0a364a6a |
hex | 1916df38d1 |
107757910225 has 81 divisors (see below), whose sum is σ = 158735191953. Its totient is φ = 72354858240.
The previous prime is 107757910223. The next prime is 107757910237. The reversal of 107757910225 is 522019757701.
The square root of 107757910225 is 328265.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 54822944449 + 52934965776 = 234143^2 + 230076^2 .
It is not a de Polignac number, because 107757910225 - 21 = 107757910223 is a prime.
It is a super-2 number, since 2×1077579102252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107757910223) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 953609769 + ... + 953609881.
Almost surely, 2107757910225 is an apocalyptic number.
107757910225 is the 328265-th square number.
107757910225 is the 164133-rd centered octagonal number.
It is an amenable number.
107757910225 is a deficient number, since it is larger than the sum of its proper divisors (50977281728).
107757910225 is an frugal number, since it uses more digits than its factorization.
107757910225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 416 (or 208 counting only the distinct ones).
The product of its (nonzero) digits is 308700, while the sum is 46.
The spelling of 107757910225 in words is "one hundred seven billion, seven hundred fifty-seven million, nine hundred ten thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •