Base | Representation |
---|---|
bin | 100100101111110000011111… |
… | …010101010100100111011111 |
3 | 210012012220200010221021110210 |
4 | 210233300133111110213133 |
5 | 132140320431101101210 |
6 | 1331415153511503503 |
7 | 46020022664451450 |
oct | 4457603725244737 |
9 | 705186603837423 |
10 | 161611555097055 |
11 | 47549091714158 |
12 | 1616149a987b93 |
13 | 6c23b9a84b2ab |
14 | 2bca080721127 |
15 | 13a3d4a0e3e20 |
hex | 92fc1f5549df |
161611555097055 has 16 divisors (see below), whose sum is σ = 295518272177664. Its totient is φ = 73879568044320.
The previous prime is 161611555096961. The next prime is 161611555097099. The reversal of 161611555097055 is 550790555116161.
It is a happy number.
It is not a de Polignac number, because 161611555097055 - 29 = 161611555096543 is a prime.
It is a super-2 number, since 2×1616115550970552 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 161611555096986 and 161611555097004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 769578833691 + ... + 769578833900.
It is an arithmetic number, because the mean of its divisors is an integer number (18469892011104).
Almost surely, 2161611555097055 is an apocalyptic number.
161611555097055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
161611555097055 is a deficient number, since it is larger than the sum of its proper divisors (133906717080609).
161611555097055 is a wasteful number, since it uses less digits than its factorization.
161611555097055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1539157667606.
The product of its (nonzero) digits is 7087500, while the sum is 57.
The spelling of 161611555097055 in words is "one hundred sixty-one trillion, six hundred eleven billion, five hundred fifty-five million, ninety-seven thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •