Base | Representation |
---|---|
bin | 11101101101000010111… |
… | …000000000001000001001 |
3 | 21020010202221002010220212 |
4 | 131231002320000020021 |
5 | 231420420222124231 |
6 | 4201421225530505 |
7 | 300321421661042 |
oct | 35550270001011 |
9 | 7203687063825 |
10 | 2041231442441 |
11 | 717754a30854 |
12 | 28b730343a35 |
13 | 11a6447997a9 |
14 | 70b208138c9 |
15 | 3816cb6142b |
hex | 1db42e00209 |
2041231442441 has 2 divisors, whose sum is σ = 2041231442442. Its totient is φ = 2041231442440.
The previous prime is 2041231442407. The next prime is 2041231442489. The reversal of 2041231442441 is 1442441321402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1971946147600 + 69285294841 = 1404260^2 + 263221^2 .
It is a cyclic number.
It is not a de Polignac number, because 2041231442441 - 230 = 2040157700617 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2041231442398 and 2041231442407.
It is not a weakly prime, because it can be changed into another prime (2041231462441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1020615721220 + 1020615721221.
It is an arithmetic number, because the mean of its divisors is an integer number (1020615721221).
Almost surely, 22041231442441 is an apocalyptic number.
It is an amenable number.
2041231442441 is a deficient number, since it is larger than the sum of its proper divisors (1).
2041231442441 is an equidigital number, since it uses as much as digits as its factorization.
2041231442441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 2041231442441 its reverse (1442441321402), we get a palindrome (3483672763843).
The spelling of 2041231442441 in words is "two trillion, forty-one billion, two hundred thirty-one million, four hundred forty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •