Base | Representation |
---|---|
bin | 10010101001010000101011… |
… | …11010000000101100000001 |
3 | 12101011120111020012011220111 |
4 | 21110220111322000230001 |
5 | 20333221224041230241 |
6 | 223111110401111321 |
7 | 11431106220120544 |
oct | 1124502572005401 |
9 | 171146436164814 |
10 | 41000125336321 |
11 | 12078067976aa8 |
12 | 4722123028541 |
13 | 19b53ab8080b8 |
14 | a1a5b942a85b |
15 | 4b179248ec81 |
hex | 254a15e80b01 |
41000125336321 has 2 divisors, whose sum is σ = 41000125336322. Its totient is φ = 41000125336320.
The previous prime is 41000125336301. The next prime is 41000125336337. The reversal of 41000125336321 is 12363352100014.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24191445510400 + 16808679825921 = 4918480^2 + 4099839^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41000125336321 is a prime.
It is not a weakly prime, because it can be changed into another prime (41000125336301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20500062668160 + 20500062668161.
It is an arithmetic number, because the mean of its divisors is an integer number (20500062668161).
Almost surely, 241000125336321 is an apocalyptic number.
It is an amenable number.
41000125336321 is a deficient number, since it is larger than the sum of its proper divisors (1).
41000125336321 is an equidigital number, since it uses as much as digits as its factorization.
41000125336321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 41000125336321 its reverse (12363352100014), we get a palindrome (53363477436335).
The spelling of 41000125336321 in words is "forty-one trillion, one hundred twenty-five million, three hundred thirty-six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •