Base | Representation |
---|---|
bin | 1100101001111… |
… | …10001110011111 |
3 | 21101202112120221 |
4 | 12110332032133 |
5 | 204134123210 |
6 | 14311222211 |
7 | 2426232310 |
oct | 624761637 |
9 | 241675527 |
10 | 106161055 |
11 | 54a1a410 |
12 | 2b677967 |
13 | 18cbcbc0 |
14 | 10156607 |
15 | 94c01da |
hex | 653e39f |
106161055 has 32 divisors (see below), whose sum is σ = 171053568. Its totient is φ = 61084800.
The previous prime is 106161017. The next prime is 106161059. The reversal of 106161055 is 550161601.
It is not a de Polignac number, because 106161055 - 215 = 106128287 is a prime.
It is a super-2 number, since 2×1061610552 = 22540339197426050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (25) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106161059) 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 in 31 ways as a sum of consecutive naturals, for example, 5601 + ... + 15610.
It is an arithmetic number, because the mean of its divisors is an integer number (5345424).
Almost surely, 2106161055 is an apocalyptic number.
106161055 is a deficient number, since it is larger than the sum of its proper divisors (64892513).
106161055 is a wasteful number, since it uses less digits than its factorization.
106161055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21247.
The product of its (nonzero) digits is 900, while the sum is 25.
The square root of 106161055 is about 10303.4486944906. The cubic root of 106161055 is about 473.5019173459.
It can be divided in two parts, 106 and 161055, that added together give a palindrome (161161).
The spelling of 106161055 in words is "one hundred six million, one hundred sixty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •