Base | Representation |
---|---|
bin | 111100100100000100010… |
… | …111100010001111111001 |
3 | 112201212120201200111221111 |
4 | 330210010113202033321 |
5 | 1021142031011311111 |
6 | 12503540543440321 |
7 | 606454451206165 |
oct | 74440427421771 |
9 | 15655521614844 |
10 | 4161896588281 |
11 | 136506113a663 |
12 | 57272a8b60a1 |
13 | 242607c73033 |
14 | 105618aadca5 |
15 | 733d91cea21 |
hex | 3c9045e23f9 |
4161896588281 has 2 divisors, whose sum is σ = 4161896588282. Its totient is φ = 4161896588280.
The previous prime is 4161896588251. The next prime is 4161896588323. The reversal of 4161896588281 is 1828856981614.
4161896588281 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3728220339600 + 433676248681 = 1930860^2 + 658541^2 .
It is a cyclic number.
It is not a de Polignac number, because 4161896588281 - 215 = 4161896555513 is a prime.
It is a super-2 number, since 2×41618965882812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4161896588221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2080948294140 + 2080948294141.
It is an arithmetic number, because the mean of its divisors is an integer number (2080948294141).
Almost surely, 24161896588281 is an apocalyptic number.
It is an amenable number.
4161896588281 is a deficient number, since it is larger than the sum of its proper divisors (1).
4161896588281 is an equidigital number, since it uses as much as digits as its factorization.
4161896588281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 53084160, while the sum is 67.
The spelling of 4161896588281 in words is "four trillion, one hundred sixty-one billion, eight hundred ninety-six million, five hundred eighty-eight thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •