Base | Representation |
---|---|
bin | 1001011001110110111… |
… | …0100000110110100111 |
3 | 120110000101122122222222 |
4 | 2112131232200312213 |
5 | 10121333330143210 |
6 | 202115235342555 |
7 | 14446415251550 |
oct | 2263556406647 |
9 | 513011578888 |
10 | 161560006055 |
11 | 62576458868 |
12 | 2738a151a5b |
13 | 1230950b826 |
14 | 7b68b97327 |
15 | 43088db655 |
hex | 259dba0da7 |
161560006055 has 8 divisors (see below), whose sum is σ = 221568008352. Its totient is φ = 110784004128.
The previous prime is 161560006037. The next prime is 161560006057. The reversal of 161560006055 is 550600065161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 161560006055 - 28 = 161560005799 is a prime.
It is a super-2 number, since 2×1615600060552 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35), and also a Moran number because the ratio is a prime number: 4616000173 = 161560006055 / (1 + 6 + 1 + 5 + 6 + 0 + 0 + 0 + 6 + 0 + 5 + 5).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161560006057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2308000052 + ... + 2308000121.
It is an arithmetic number, because the mean of its divisors is an integer number (27696001044).
Almost surely, 2161560006055 is an apocalyptic number.
161560006055 is a deficient number, since it is larger than the sum of its proper divisors (60008002297).
161560006055 is an equidigital number, since it uses as much as digits as its factorization.
161560006055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4616000185.
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 161560006055 in words is "one hundred sixty-one billion, five hundred sixty million, six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •