Base | Representation |
---|---|
bin | 1001011001100001111… |
… | …1100111101011011011 |
3 | 120102210021110110100222 |
4 | 2112120133213223123 |
5 | 10121143341401041 |
6 | 202102421550255 |
7 | 14444301121316 |
oct | 2263037475333 |
9 | 512707413328 |
10 | 161472215771 |
11 | 62530946709 |
12 | 2736487538b |
13 | 122c4281609 |
14 | 7b5b26397d |
15 | 4300d4974b |
hex | 25987e7adb |
161472215771 has 2 divisors, whose sum is σ = 161472215772. Its totient is φ = 161472215770.
The previous prime is 161472215759. The next prime is 161472215791. The reversal of 161472215771 is 177512274161.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (177512274161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 161472215771 - 210 = 161472214747 is a prime.
It is a super-2 number, since 2×1614722157712 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (161472215791) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80736107885 + 80736107886.
It is an arithmetic number, because the mean of its divisors is an integer number (80736107886).
Almost surely, 2161472215771 is an apocalyptic number.
161472215771 is a deficient number, since it is larger than the sum of its proper divisors (1).
161472215771 is an equidigital number, since it uses as much as digits as its factorization.
161472215771 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 164640, while the sum is 44.
The spelling of 161472215771 in words is "one hundred sixty-one billion, four hundred seventy-two million, two hundred fifteen thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •