Base | Representation |
---|---|
bin | 10010110001010000111000… |
… | …10000011101010000011101 |
3 | 12102010212021100221211022202 |
4 | 21120220130100131100131 |
5 | 20402222411101300444 |
6 | 223441305040221245 |
7 | 11460012461324402 |
oct | 1130503420352035 |
9 | 172125240854282 |
10 | 41275109790749 |
11 | 1217374848969a |
12 | 476748690a825 |
13 | 1a052c2b19723 |
14 | a29a240da2a9 |
15 | 4b89d890a34e |
hex | 258a1c41d41d |
41275109790749 has 2 divisors, whose sum is σ = 41275109790750. Its totient is φ = 41275109790748.
The previous prime is 41275109790713. The next prime is 41275109790779. The reversal of 41275109790749 is 94709790157214.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24333571470649 + 16941538320100 = 4932907^2 + 4116010^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41275109790749 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41275109790779) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20637554895374 + 20637554895375.
It is an arithmetic number, because the mean of its divisors is an integer number (20637554895375).
Almost surely, 241275109790749 is an apocalyptic number.
It is an amenable number.
41275109790749 is a deficient number, since it is larger than the sum of its proper divisors (1).
41275109790749 is an equidigital number, since it uses as much as digits as its factorization.
41275109790749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40007520, while the sum is 65.
The spelling of 41275109790749 in words is "forty-one trillion, two hundred seventy-five billion, one hundred nine million, seven hundred ninety thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •