Base | Representation |
---|---|
bin | 10111001101011011010100… |
… | …101010011110011100010001 |
3 | 111101102112112122120021000002 |
4 | 113031123110222132130101 |
5 | 101334420223212130030 |
6 | 1001033513104335345 |
7 | 30333606032310464 |
oct | 2715332452363421 |
9 | 441375478507002 |
10 | 102077760661265 |
11 | 2a585a31805774 |
12 | b54742b614555 |
13 | 44c5b788b8bcc |
14 | 1b2c838c7d2db |
15 | bc042437d245 |
hex | 5cd6d4a9e711 |
102077760661265 has 16 divisors (see below), whose sum is σ = 129743265175632. Its totient is φ = 76832200525824.
The previous prime is 102077760661187. The next prime is 102077760661297. The reversal of 102077760661265 is 562166067770201.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 35029683913744 + 67048076747521 = 5918588^2 + 8188289^2 .
It is a cyclic number.
It is not a de Polignac number, because 102077760661265 - 240 = 100978249033489 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 102077760661265.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 205599644 + ... + 206095533.
It is an arithmetic number, because the mean of its divisors is an integer number (8108954073477).
Almost surely, 2102077760661265 is an apocalyptic number.
It is an amenable number.
102077760661265 is a deficient number, since it is larger than the sum of its proper divisors (27665504514367).
102077760661265 is a wasteful number, since it uses less digits than its factorization.
102077760661265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411698116.
The product of its (nonzero) digits is 8890560, while the sum is 56.
The spelling of 102077760661265 in words is "one hundred two trillion, seventy-seven billion, seven hundred sixty million, six hundred sixty-one thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •