Base | Representation |
---|---|
bin | 1001011000000111010… |
… | …0000001101001011111 |
3 | 120101210202102200211220 |
4 | 2112001310001221133 |
5 | 10114403433022210 |
6 | 202000545544423 |
7 | 14432000523063 |
oct | 2260164015137 |
9 | 511722380756 |
10 | 161091689055 |
11 | 62356071320 |
12 | 27279345113 |
13 | 1226349a78b |
14 | 7b228cbaa3 |
15 | 42cc730c70 |
hex | 2581d01a5f |
161091689055 has 16 divisors (see below), whose sum is σ = 281178221184. Its totient is φ = 78105061280.
The previous prime is 161091689051. The next prime is 161091689081. The reversal of 161091689055 is 550986190161.
It is not a de Polignac number, because 161091689055 - 22 = 161091689051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 161091688989 and 161091689007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161091689051) 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 15 ways as a sum of consecutive naturals, for example, 488156469 + ... + 488156798.
It is an arithmetic number, because the mean of its divisors is an integer number (17573638824).
Almost surely, 2161091689055 is an apocalyptic number.
161091689055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
161091689055 is a deficient number, since it is larger than the sum of its proper divisors (120086532129).
161091689055 is a wasteful number, since it uses less digits than its factorization.
161091689055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 976313286.
The product of its (nonzero) digits is 583200, while the sum is 51.
The spelling of 161091689055 in words is "one hundred sixty-one billion, ninety-one million, six hundred eighty-nine thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •