Base | Representation |
---|---|
bin | 100100101011111001111011… |
… | …100000010000001000010101 |
3 | 210011021121022211220101100002 |
4 | 210223321323200100020111 |
5 | 132122001233223300111 |
6 | 1331053411452301045 |
7 | 45661631310115466 |
oct | 4453717340201025 |
9 | 704247284811302 |
10 | 161346813493781 |
11 | 47456887a07203 |
12 | 1611a115471785 |
13 | 6c04c29635936 |
14 | 2bbb32814cd6d |
15 | 139c00300763b |
hex | 92be7b810215 |
161346813493781 has 2 divisors, whose sum is σ = 161346813493782. Its totient is φ = 161346813493780.
The previous prime is 161346813493741. The next prime is 161346813493787. The reversal of 161346813493781 is 187394318643161.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 140446912060900 + 20899901432881 = 11851030^2 + 4571641^2 .
It is a cyclic number.
It is not a de Polignac number, because 161346813493781 - 230 = 161345739751957 is a prime.
It is a super-2 number, since 2×1613468134937812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161346813493787) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80673406746890 + 80673406746891.
It is an arithmetic number, because the mean of its divisors is an integer number (80673406746891).
Almost surely, 2161346813493781 is an apocalyptic number.
It is an amenable number.
161346813493781 is a deficient number, since it is larger than the sum of its proper divisors (1).
161346813493781 is an equidigital number, since it uses as much as digits as its factorization.
161346813493781 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 62705664, while the sum is 65.
The spelling of 161346813493781 in words is "one hundred sixty-one trillion, three hundred forty-six billion, eight hundred thirteen million, four hundred ninety-three thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •