Base | Representation |
---|---|
bin | 10010110001111111101011… |
… | …00110011011101110110101 |
3 | 12102020021010010000201100121 |
4 | 21120333311212123232311 |
5 | 20403130333121402041 |
6 | 223501021512011541 |
7 | 11461562140420015 |
oct | 1130776546335665 |
9 | 172207103021317 |
10 | 41300231044021 |
11 | 12183369803034 |
12 | 4770317990bb1 |
13 | 1a077974c8431 |
14 | a2ad28607c45 |
15 | 4b94a907e7d1 |
hex | 258ff599bbb5 |
41300231044021 has 2 divisors, whose sum is σ = 41300231044022. Its totient is φ = 41300231044020.
The previous prime is 41300231043997. The next prime is 41300231044043. The reversal of 41300231044021 is 12044013200314.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34561300600996 + 6738930443025 = 5878886^2 + 2595945^2 .
It is a cyclic number.
It is not a de Polignac number, because 41300231044021 - 215 = 41300231011253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41300231074021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20650115522010 + 20650115522011.
It is an arithmetic number, because the mean of its divisors is an integer number (20650115522011).
Almost surely, 241300231044021 is an apocalyptic number.
It is an amenable number.
41300231044021 is a deficient number, since it is larger than the sum of its proper divisors (1).
41300231044021 is an equidigital number, since it uses as much as digits as its factorization.
41300231044021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 41300231044021 its reverse (12044013200314), we get a palindrome (53344244244335).
The spelling of 41300231044021 in words is "forty-one trillion, three hundred billion, two hundred thirty-one million, forty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •