Base | Representation |
---|---|
bin | 110001101101101111… |
… | …1000001000001010111 |
3 | 101012120101200222102202 |
4 | 1203123133001001113 |
5 | 3222121424243210 |
6 | 121013502355115 |
7 | 10466436152630 |
oct | 1433337010127 |
9 | 335511628382 |
10 | 106761556055 |
11 | 4130612a260 |
12 | 1883628ba9b |
13 | a0b55bab9b |
14 | 524b06c887 |
15 | 2b9cb539a5 |
hex | 18db7c1057 |
106761556055 has 128 divisors (see below), whose sum is σ = 171367612416. Its totient is φ = 61879910400.
The previous prime is 106761556049. The next prime is 106761556067. The reversal of 106761556055 is 550655167601.
It is not a de Polignac number, because 106761556055 - 24 = 106761556039 is a prime.
It is a super-2 number, since 2×1067615560552 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 127 ways as a sum of consecutive naturals, for example, 97856060 + ... + 97857150.
It is an arithmetic number, because the mean of its divisors is an integer number (1338809472).
Almost surely, 2106761556055 is an apocalyptic number.
106761556055 is a deficient number, since it is larger than the sum of its proper divisors (64606056361).
106761556055 is a wasteful number, since it uses less digits than its factorization.
106761556055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1437.
The product of its (nonzero) digits is 945000, while the sum is 47.
The spelling of 106761556055 in words is "one hundred six billion, seven hundred sixty-one million, five hundred fifty-six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •