Base | Representation |
---|---|
bin | 100100011001111110001101… |
… | …000010011100010001100101 |
3 | 202222220210101110102212011011 |
4 | 210121332031002130101211 |
5 | 131441303344211231031 |
6 | 1324311321441542221 |
7 | 45503613245534023 |
oct | 4431761502342145 |
9 | 688823343385134 |
10 | 160114452055141 |
11 | 47021181012301 |
12 | 15b5b306044971 |
13 | 6b4596067bc8c |
14 | 2b7781bb17713 |
15 | 1379e272376b1 |
hex | 919f8d09c465 |
160114452055141 has 8 divisors (see below), whose sum is σ = 160124174028000. Its totient is φ = 160104730435440.
The previous prime is 160114452055123. The next prime is 160114452055213. The reversal of 160114452055141 is 141550254411061.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 160114452055141 - 29 = 160114452054629 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 160114452055094 and 160114452055103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160114452085141) 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, 1984792155 + ... + 1984872823.
It is an arithmetic number, because the mean of its divisors is an integer number (20015521753500).
Almost surely, 2160114452055141 is an apocalyptic number.
It is an amenable number.
160114452055141 is a deficient number, since it is larger than the sum of its proper divisors (9721972859).
160114452055141 is an equidigital number, since it uses as much as digits as its factorization.
160114452055141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176579.
The product of its (nonzero) digits is 96000, while the sum is 40.
The spelling of 160114452055141 in words is "one hundred sixty trillion, one hundred fourteen billion, four hundred fifty-two million, fifty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •