Base | Representation |
---|---|
bin | 100100101010000111001111… |
… | …001000111001010111101001 |
3 | 210010211211110020210002002211 |
4 | 210222013033020321113221 |
5 | 132112442030111341201 |
6 | 1330521043401325121 |
7 | 45650011440621655 |
oct | 4452071710712751 |
9 | 703754406702084 |
10 | 161223662605801 |
11 | 474096314a3334 |
12 | 160ba2864967a1 |
13 | 6bc6431716c13 |
14 | 2bb53a4563a65 |
15 | 1398be6605651 |
hex | 92a1cf2395e9 |
161223662605801 has 2 divisors, whose sum is σ = 161223662605802. Its totient is φ = 161223662605800.
The previous prime is 161223662605721. The next prime is 161223662605807. The reversal of 161223662605801 is 108506266322161.
161223662605801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 153716479080025 + 7507183525776 = 12398245^2 + 2739924^2 .
It is a cyclic number.
It is not a de Polignac number, because 161223662605801 - 27 = 161223662605673 is a prime.
It is not a weakly prime, because it can be changed into another prime (161223662605807) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80611831302900 + 80611831302901.
It is an arithmetic number, because the mean of its divisors is an integer number (80611831302901).
Almost surely, 2161223662605801 is an apocalyptic number.
It is an amenable number.
161223662605801 is a deficient number, since it is larger than the sum of its proper divisors (1).
161223662605801 is an equidigital number, since it uses as much as digits as its factorization.
161223662605801 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1244160, while the sum is 49.
The spelling of 161223662605801 in words is "one hundred sixty-one trillion, two hundred twenty-three billion, six hundred sixty-two million, six hundred five thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •