Base | Representation |
---|---|
bin | 10111111001011111101001… |
… | …010111111001001111010111 |
3 | 111210011001010001010201022000 |
4 | 113321133221113321033113 |
5 | 102234024202333234021 |
6 | 1011313020222210343 |
7 | 31065443102406264 |
oct | 2771375127711727 |
9 | 453131101121260 |
10 | 105106060055511 |
11 | 30543258879179 |
12 | b956312a239b3 |
13 | 46855c73819b8 |
14 | 1bd52363bc26b |
15 | c240b3277b26 |
hex | 5f97e95f93d7 |
105106060055511 has 8 divisors (see below), whose sum is σ = 155712681563760. Its totient is φ = 70070706703656.
The previous prime is 105106060055467. The next prime is 105106060055537. The reversal of 105106060055511 is 115550060601501.
It is a happy number.
105106060055511 is a `hidden beast` number, since 10 + 5 + 10 + 60 + 60 + 0 + 5 + 5 + 511 = 666.
It is not a de Polignac number, because 105106060055511 - 29 = 105106060054999 is a prime.
It is a super-2 number, since 2×1051060600555112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105106060015511) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1946408519520 + ... + 1946408519573.
It is an arithmetic number, because the mean of its divisors is an integer number (19464085195470).
Almost surely, 2105106060055511 is an apocalyptic number.
105106060055511 is a deficient number, since it is larger than the sum of its proper divisors (50606621508249).
105106060055511 is an equidigital number, since it uses as much as digits as its factorization.
105106060055511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3892817039102 (or 3892817039096 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 36.
The spelling of 105106060055511 in words is "one hundred five trillion, one hundred six billion, sixty million, fifty-five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •