Base | Representation |
---|---|
bin | 11000000111011000100101… |
… | …110001000000011001110010 |
3 | 111220112021211111200011210200 |
4 | 120013120211301000121302 |
5 | 102400144004314323442 |
6 | 1013323314035140030 |
7 | 31224423310230006 |
oct | 3007304561003162 |
9 | 456467744604720 |
10 | 106060556011122 |
11 | 3088103596a009 |
12 | ba8b2b5744616 |
13 | 472461019948b |
14 | 1c2950326a706 |
15 | c3dd29bd934c |
hex | 607625c40672 |
106060556011122 has 24 divisors (see below), whose sum is σ = 231261552072876. Its totient is φ = 35128337021856.
The previous prime is 106060556011117. The next prime is 106060556011139. The reversal of 106060556011122 is 221110655060601.
106060556011122 is a `hidden beast` number, since 1 + 0 + 6 + 0 + 60 + 5 + 560 + 1 + 11 + 22 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 98763863876001 + 7296692135121 = 9938001^2 + 2701239^2 .
It is a super-2 number, since 2×1060605560111222 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18765134473 + ... + 18765140124.
Almost surely, 2106060556011122 is an apocalyptic number.
106060556011122 is an abundant number, since it is smaller than the sum of its proper divisors (125200996061754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106060556011122 is a wasteful number, since it uses less digits than its factorization.
106060556011122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37530274762 (or 37530274759 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The spelling of 106060556011122 in words is "one hundred six trillion, sixty billion, five hundred fifty-six million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •