Base | Representation |
---|---|
bin | 100100101101010010110100… |
… | …110111011100101011011001 |
3 | 210011121201201001001020112112 |
4 | 210231102310313130223121 |
5 | 132130032224340000223 |
6 | 1331205315220522105 |
7 | 46001550554632061 |
oct | 4455226467345331 |
9 | 704551631036475 |
10 | 161442265156313 |
11 | 47493309987019 |
12 | 16134713b50335 |
13 | 6c10c2ba4611b |
14 | 2bc1bc10c03a1 |
15 | 139e73cca6778 |
hex | 92d4b4ddcad9 |
161442265156313 has 4 divisors (see below), whose sum is σ = 161462047331508. Its totient is φ = 161422482981120.
The previous prime is 161442265156231. The next prime is 161442265156321. The reversal of 161442265156313 is 313651562244161.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 30161932192144 + 131280332964169 = 5491988^2 + 11457763^2 .
It is a cyclic number.
It is not a de Polignac number, because 161442265156313 - 232 = 161437970189017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (161442265156373) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9891075356 + ... + 9891091677.
It is an arithmetic number, because the mean of its divisors is an integer number (40365511832877).
Almost surely, 2161442265156313 is an apocalyptic number.
It is an amenable number.
161442265156313 is a deficient number, since it is larger than the sum of its proper divisors (19782175195).
161442265156313 is an equidigital number, since it uses as much as digits as its factorization.
161442265156313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19782175194.
The product of its digits is 3110400, while the sum is 50.
The spelling of 161442265156313 in words is "one hundred sixty-one trillion, four hundred forty-two billion, two hundred sixty-five million, one hundred fifty-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •