Base | Representation |
---|---|
bin | 10010110000000101000101… |
… | …00111100001101001100001 |
3 | 12101222222020020020022101022 |
4 | 21120002202213201221201 |
5 | 20401041040030441113 |
6 | 223410454535015225 |
7 | 11454042140423015 |
oct | 1130024247415141 |
9 | 171888206208338 |
10 | 41234414312033 |
11 | 1215846499a158 |
12 | 475b609b0a515 |
13 | 1a0150894b9c7 |
14 | a27a83410545 |
15 | 4b7905d45908 |
hex | 2580a29e1a61 |
41234414312033 has 2 divisors, whose sum is σ = 41234414312034. Its totient is φ = 41234414312032.
The previous prime is 41234414312029. The next prime is 41234414312101. The reversal of 41234414312033 is 33021341443214.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 36304384697344 + 4930029614689 = 6025312^2 + 2220367^2 .
It is a cyclic number.
It is not a de Polignac number, because 41234414312033 - 22 = 41234414312029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41234414311984 and 41234414312002.
It is not a weakly prime, because it can be changed into another prime (41234464312033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20617207156016 + 20617207156017.
It is an arithmetic number, because the mean of its divisors is an integer number (20617207156017).
Almost surely, 241234414312033 is an apocalyptic number.
It is an amenable number.
41234414312033 is a deficient number, since it is larger than the sum of its proper divisors (1).
41234414312033 is an equidigital number, since it uses as much as digits as its factorization.
41234414312033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 41234414312033 its reverse (33021341443214), we get a palindrome (74255755755247).
The spelling of 41234414312033 in words is "forty-one trillion, two hundred thirty-four billion, four hundred fourteen million, three hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •