Base | Representation |
---|---|
bin | 10010110101111001010100… |
… | …11010111110111111000001 |
3 | 12102201002001220110011220001 |
4 | 21122330222122332333001 |
5 | 20412324331333040223 |
6 | 224042345315520001 |
7 | 11504345422215262 |
oct | 1132745232767701 |
9 | 172632056404801 |
10 | 41434261221313 |
11 | 122251982a7aa4 |
12 | 47922a22b9001 |
13 | 1a1730732924c |
14 | a33601040969 |
15 | 4bcc00b299ad |
hex | 25af2a6befc1 |
41434261221313 has 2 divisors, whose sum is σ = 41434261221314. Its totient is φ = 41434261221312.
The previous prime is 41434261221281. The next prime is 41434261221329. The reversal of 41434261221313 is 31312216243414.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33704259858369 + 7730001362944 = 5805537^2 + 2780288^2 .
It is a cyclic number.
It is not a de Polignac number, because 41434261221313 - 25 = 41434261221281 is a prime.
It is a super-3 number, since 3×414342612213133 (a number of 42 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (41434261224313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20717130610656 + 20717130610657.
It is an arithmetic number, because the mean of its divisors is an integer number (20717130610657).
Almost surely, 241434261221313 is an apocalyptic number.
It is an amenable number.
41434261221313 is a deficient number, since it is larger than the sum of its proper divisors (1).
41434261221313 is an equidigital number, since it uses as much as digits as its factorization.
41434261221313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 82944, while the sum is 37.
Adding to 41434261221313 its reverse (31312216243414), we get a palindrome (72746477464727).
The spelling of 41434261221313 in words is "forty-one trillion, four hundred thirty-four billion, two hundred sixty-one million, two hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •