Base | Representation |
---|---|
bin | 100100101001000100000101… |
… | …100011010010011111000111 |
3 | 210010120221100100222112201020 |
4 | 210221010011203102133013 |
5 | 132110301344112100210 |
6 | 1330424001035002223 |
7 | 45641546624535432 |
oct | 4451040543223707 |
9 | 703527310875636 |
10 | 161151561050055 |
11 | 47390aa2000334 |
12 | 160a8303899373 |
13 | 6bbc6b0a88574 |
14 | 2bb1ac47b8819 |
15 | 1396dc6771770 |
hex | 9291058d27c7 |
161151561050055 has 16 divisors (see below), whose sum is σ = 258416757151200. Its totient is φ = 85756079403008.
The previous prime is 161151561049993. The next prime is 161151561050057. The reversal of 161151561050055 is 550050165151161.
It is a cyclic number.
It is not a de Polignac number, because 161151561050055 - 26 = 161151561049991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 161151561049989 and 161151561050016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161151561050057) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11963732022 + ... + 11963745491.
It is an arithmetic number, because the mean of its divisors is an integer number (16151047321950).
Almost surely, 2161151561050055 is an apocalyptic number.
161151561050055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
161151561050055 is a deficient number, since it is larger than the sum of its proper divisors (97265196101145).
161151561050055 is a wasteful number, since it uses less digits than its factorization.
161151561050055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23927477970.
The product of its (nonzero) digits is 112500, while the sum is 42.
The spelling of 161151561050055 in words is "one hundred sixty-one trillion, one hundred fifty-one billion, five hundred sixty-one million, fifty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.971 sec. • engine limits •