Base | Representation |
---|---|
bin | 111100100011011000010… |
… | …000011111101100111101 |
3 | 112201210200011011102212201 |
4 | 330203120100133230331 |
5 | 1021134022033422331 |
6 | 12503335310031501 |
7 | 606430224020455 |
oct | 74433020375475 |
9 | 15653604142781 |
10 | 4161156545341 |
11 | 1364811430424 |
12 | 572562aa8591 |
13 | 24251a8536c3 |
14 | 1055886b0d65 |
15 | 7339424ca61 |
hex | 3c8d841fb3d |
4161156545341 has 2 divisors, whose sum is σ = 4161156545342. Its totient is φ = 4161156545340.
The previous prime is 4161156545323. The next prime is 4161156545443. The reversal of 4161156545341 is 1435456511614.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4110877900900 + 50278644441 = 2027530^2 + 224229^2 .
It is a cyclic number.
It is not a de Polignac number, because 4161156545341 - 217 = 4161156414269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4161156545291 and 4161156545300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4161156645341) 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, 2080578272670 + 2080578272671.
It is an arithmetic number, because the mean of its divisors is an integer number (2080578272671).
Almost surely, 24161156545341 is an apocalyptic number.
It is an amenable number.
4161156545341 is a deficient number, since it is larger than the sum of its proper divisors (1).
4161156545341 is an equidigital number, since it uses as much as digits as its factorization.
4161156545341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864000, while the sum is 46.
The spelling of 4161156545341 in words is "four trillion, one hundred sixty-one billion, one hundred fifty-six million, five hundred forty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •