Base | Representation |
---|---|
bin | 10100000011011100… |
… | …10110001110100001 |
3 | 1000210022210000000000 |
4 | 22001232112032201 |
5 | 134022141020441 |
6 | 4540200050213 |
7 | 530541265200 |
oct | 120156261641 |
9 | 30708700000 |
10 | 10766345121 |
11 | 4625359494 |
12 | 2105763969 |
13 | 10276b891c |
14 | 741c4b237 |
15 | 4302d82b6 |
hex | 281b963a1 |
10766345121 has 99 divisors (see below), whose sum is σ = 19099084563. Its totient is φ = 6051341520.
The previous prime is 10766345101. The next prime is 10766345147. The reversal of 10766345121 is 12154366701.
The square root of 10766345121 is 103761.
It is a perfect power (a square), and thus also a powerful number.
10766345121 is a `hidden beast` number, since 1 + 0 + 7 + 6 + 634 + 5 + 12 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 350101521 + 10416243600 = 18711^2 + 102060^2 .
It is not a de Polignac number, because 10766345121 - 27 = 10766344993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10766345101) by changing a digit.
It is a polite number, since it can be written in 98 ways as a sum of consecutive naturals, for example, 176497431 + ... + 176497491.
Almost surely, 210766345121 is an apocalyptic number.
10766345121 is the 103761-st square number.
10766345121 is the 51881-st centered octagonal number.
It is an amenable number.
10766345121 is a deficient number, since it is larger than the sum of its proper divisors (8332739442).
10766345121 is an frugal number, since it uses more digits than its factorization.
10766345121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166 (or 71 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
Multiplying 10766345121 by its sum of digits (36), we get a square (387588424356 = 6225662).
The spelling of 10766345121 in words is "ten billion, seven hundred sixty-six million, three hundred forty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •