Base | Representation |
---|---|
bin | 100100101111101010011111… |
… | …001101001010001001000110 |
3 | 210012012022001000022010121012 |
4 | 210233222133031022021012 |
5 | 132140214231242143204 |
6 | 1331412210213522222 |
7 | 46016404201362425 |
oct | 4457523715121106 |
9 | 705168030263535 |
10 | 161605110506054 |
11 | 47546384931596 |
12 | 161601a0643372 |
13 | 6c233b162a837 |
14 | 2bc9a2c8612bc |
15 | 13a3abe43a76e |
hex | 92fa9f34a246 |
161605110506054 has 4 divisors (see below), whose sum is σ = 242407665759084. Its totient is φ = 80802555253026.
The previous prime is 161605110506053. The next prime is 161605110506057. The reversal of 161605110506054 is 450605011506161.
It is a happy number.
161605110506054 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1616051105060542 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161605110506053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40401277626512 + ... + 40401277626515.
It is an arithmetic number, because the mean of its divisors is an integer number (60601916439771).
Almost surely, 2161605110506054 is an apocalyptic number.
161605110506054 is a deficient number, since it is larger than the sum of its proper divisors (80802555253030).
161605110506054 is an equidigital number, since it uses as much as digits as its factorization.
161605110506054 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80802555253029.
The product of its (nonzero) digits is 108000, while the sum is 41.
The spelling of 161605110506054 in words is "one hundred sixty-one trillion, six hundred five billion, one hundred ten million, five hundred six thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •