Base | Representation |
---|---|
bin | 110001011011101011… |
… | …1100000000000101101 |
3 | 101011000011111112022101 |
4 | 1202313113200000231 |
5 | 3214401313343221 |
6 | 120433415015101 |
7 | 10445430522601 |
oct | 1426727400055 |
9 | 334004445271 |
10 | 106155606061 |
11 | 4102508803a |
12 | 186a736a491 |
13 | a019bbacab |
14 | 51d07b7501 |
15 | 2b6485cd91 |
hex | 18b75e002d |
106155606061 has 2 divisors, whose sum is σ = 106155606062. Its totient is φ = 106155606060.
The previous prime is 106155606023. The next prime is 106155606101. The reversal of 106155606061 is 160606551601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106141730436 + 13875625 = 325794^2 + 3725^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106155606061 is a prime.
It is a super-2 number, since 2×1061556060612 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106155606061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106155646061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53077803030 + 53077803031.
It is an arithmetic number, because the mean of its divisors is an integer number (53077803031).
Almost surely, 2106155606061 is an apocalyptic number.
It is an amenable number.
106155606061 is a deficient number, since it is larger than the sum of its proper divisors (1).
106155606061 is an equidigital number, since it uses as much as digits as its factorization.
106155606061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 37.
The spelling of 106155606061 in words is "one hundred six billion, one hundred fifty-five million, six hundred six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.022 sec. • engine limits •