Base | Representation |
---|---|
bin | 110001101101010000… |
… | …1000001011110000001 |
3 | 101012112021010100010101 |
4 | 1203122201001132001 |
5 | 3222103244224321 |
6 | 121012122202401 |
7 | 10466151056431 |
oct | 1433241013601 |
9 | 335467110111 |
10 | 106745304961 |
11 | 412a7a3a5a9 |
12 | 18830953401 |
13 | a0b211ac59 |
14 | 5248c3c2c1 |
15 | 2b9b4e3791 |
hex | 18da841781 |
106745304961 has 9 divisors (see below), whose sum is σ = 107987583043. Its totient is φ = 105517168240.
The previous prime is 106745304937. The next prime is 106745304973. The reversal of 106745304961 is 169403547601.
The square root of 106745304961 is 326719.
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., 20497362561 + 86247942400 = 143169^2 + 293680^2 .
It is not a de Polignac number, because 106745304961 - 217 = 106745173889 is a prime.
It is a super-2 number, since 2×1067453049612 (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 (106745304901) 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, 29076156 + ... + 29079826.
Almost surely, 2106745304961 is an apocalyptic number.
106745304961 is the 326719-th square number.
106745304961 is the 163360-th centered octagonal number.
It is an amenable number.
106745304961 is a deficient number, since it is larger than the sum of its proper divisors (1242278082).
106745304961 is an frugal number, since it uses more digits than its factorization.
106745304961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7520 (or 3760 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 46.
The spelling of 106745304961 in words is "one hundred six billion, seven hundred forty-five million, three hundred four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •