Base | Representation |
---|---|
bin | 100100011001111111010010… |
… | …011000110111010101011111 |
3 | 202222220220101112210002012210 |
4 | 210121333102120313111133 |
5 | 131441313240040423210 |
6 | 1324312033123531503 |
7 | 45503654134265400 |
oct | 4431772230672537 |
9 | 688826345702183 |
10 | 160115615561055 |
11 | 47021718862540 |
12 | 15b5b58b829b93 |
13 | 6b45ab773660b |
14 | 2b778cc4679a7 |
15 | 1379e94464e20 |
hex | 919fd263755f |
160115615561055 has 96 divisors (see below), whose sum is σ = 336313473085440. Its totient is φ = 64247018062080.
The previous prime is 160115615561047. The next prime is 160115615561129. The reversal of 160115615561055 is 550165516511061.
It is not a de Polignac number, because 160115615561055 - 23 = 160115615561047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 160115615560995 and 160115615561013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 341214399 + ... + 341683328.
It is an arithmetic number, because the mean of its divisors is an integer number (3503265344640).
Almost surely, 2160115615561055 is an apocalyptic number.
160115615561055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
160115615561055 is an abundant number, since it is smaller than the sum of its proper divisors (176197857524385).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
160115615561055 is a wasteful number, since it uses less digits than its factorization.
160115615561055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 682897789 (or 682897782 counting only the distinct ones).
The product of its (nonzero) digits is 675000, while the sum is 48.
The spelling of 160115615561055 in words is "one hundred sixty trillion, one hundred fifteen billion, six hundred fifteen million, five hundred sixty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •