Base | Representation |
---|---|
bin | 100110010100110010… |
… | …110011110100101101 |
3 | 10221012212222002111211 |
4 | 212110302303310231 |
5 | 1133234132144401 |
6 | 30523213514421 |
7 | 2654522115514 |
oct | 462462636455 |
9 | 127185862454 |
10 | 41151053101 |
11 | 164a77732a4 |
12 | 7b854a2a11 |
13 | 3b5a699a82 |
14 | 1dc53d967b |
15 | 110caa4951 |
hex | 994cb3d2d |
41151053101 has 2 divisors, whose sum is σ = 41151053102. Its totient is φ = 41151053100.
The previous prime is 41151053089. The next prime is 41151053171. The reversal of 41151053101 is 10135015114.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 34464066025 + 6686987076 = 185645^2 + 81774^2 .
It is a cyclic number.
It is not a de Polignac number, because 41151053101 - 215 = 41151020333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41151053171) 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, 20575526550 + 20575526551.
It is an arithmetic number, because the mean of its divisors is an integer number (20575526551).
Almost surely, 241151053101 is an apocalyptic number.
It is an amenable number.
41151053101 is a deficient number, since it is larger than the sum of its proper divisors (1).
41151053101 is an equidigital number, since it uses as much as digits as its factorization.
41151053101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 300, while the sum is 22.
Adding to 41151053101 its reverse (10135015114), we get a palindrome (51286068215).
The spelling of 41151053101 in words is "forty-one billion, one hundred fifty-one million, fifty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •