Base | Representation |
---|---|
bin | 11000001111010101000100… |
… | …000100110010111110001101 |
3 | 111222110111002001022212121111 |
4 | 120033111010010302332031 |
5 | 102433120130443041221 |
6 | 1014422210041132021 |
7 | 31312032036154564 |
oct | 3017250404627615 |
9 | 458414061285544 |
10 | 106606525362061 |
11 | 30a7163438222a |
12 | bb5908578a011 |
13 | 4763c4bcc400a |
14 | 1c47ad776cbdb |
15 | c4d1313d5be1 |
hex | 60f544132f8d |
106606525362061 has 16 divisors (see below), whose sum is σ = 108389316199936. Its totient is φ = 104829385199616.
The previous prime is 106606525362053. The next prime is 106606525362097. The reversal of 106606525362061 is 160263525606601.
It is a cyclic number.
It is not a de Polignac number, because 106606525362061 - 23 = 106606525362053 is a prime.
It is a super-2 number, since 2×1066065253620612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106606525361996 and 106606525362014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106606525362661) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1953296005 + ... + 1953350581.
It is an arithmetic number, because the mean of its divisors is an integer number (6774332262496).
Almost surely, 2106606525362061 is an apocalyptic number.
It is an amenable number.
106606525362061 is a deficient number, since it is larger than the sum of its proper divisors (1782790837875).
106606525362061 is an equidigital number, since it uses as much as digits as its factorization.
106606525362061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105748.
The product of its (nonzero) digits is 2332800, while the sum is 49.
The spelling of 106606525362061 in words is "one hundred six trillion, six hundred six billion, five hundred twenty-five million, three hundred sixty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.527 sec. • engine limits •