Base | Representation |
---|---|
bin | 110001011010100000… |
… | …0100111001001101001 |
3 | 101010220102001221201220 |
4 | 1202311000213021221 |
5 | 3214311202122221 |
6 | 120425443132253 |
7 | 10444440361422 |
oct | 1426500471151 |
9 | 333812057656 |
10 | 106116051561 |
11 | 41004821173 |
12 | 18696074089 |
13 | a01194c170 |
14 | 51c943c649 |
15 | 2b611480c6 |
hex | 18b5027269 |
106116051561 has 32 divisors (see below), whose sum is σ = 155891688960. Its totient is φ = 63810699264.
The previous prime is 106116051553. The next prime is 106116051571. The reversal of 106116051561 is 165150611601.
It is not a de Polignac number, because 106116051561 - 23 = 106116051553 is a prime.
It is a super-2 number, since 2×1061160515612 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106116051511) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 121321 + ... + 476393.
It is an arithmetic number, because the mean of its divisors is an integer number (4871615280).
Almost surely, 2106116051561 is an apocalyptic number.
It is an amenable number.
106116051561 is a deficient number, since it is larger than the sum of its proper divisors (49775637399).
106116051561 is a wasteful number, since it uses less digits than its factorization.
106116051561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 355265.
The product of its (nonzero) digits is 5400, while the sum is 33.
The spelling of 106116051561 in words is "one hundred six billion, one hundred sixteen million, fifty-one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •