Base | Representation |
---|---|
bin | 10010101100010000110111… |
… | …01110001011101100110101 |
3 | 12101112102210210111120000111 |
4 | 21112020123232023230311 |
5 | 20341414030320122401 |
6 | 223230332445343021 |
7 | 11441421100220053 |
oct | 1126103356135465 |
9 | 171472723446014 |
10 | 41103302114101 |
11 | 121078a3534287 |
12 | 473a118867a71 |
13 | 19c20425153b6 |
14 | a215a634d1d3 |
15 | 4b42d053be51 |
hex | 25621bb8bb35 |
41103302114101 has 2 divisors, whose sum is σ = 41103302114102. Its totient is φ = 41103302114100.
The previous prime is 41103302114099. The next prime is 41103302114107. The reversal of 41103302114101 is 10141120330114.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33898769730225 + 7204532383876 = 5822265^2 + 2684126^2 .
It is a cyclic number.
It is not a de Polignac number, because 41103302114101 - 21 = 41103302114099 is a prime.
Together with 41103302114099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41103302114107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20551651057050 + 20551651057051.
It is an arithmetic number, because the mean of its divisors is an integer number (20551651057051).
Almost surely, 241103302114101 is an apocalyptic number.
It is an amenable number.
41103302114101 is a deficient number, since it is larger than the sum of its proper divisors (1).
41103302114101 is an equidigital number, since it uses as much as digits as its factorization.
41103302114101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 41103302114101 its reverse (10141120330114), we get a palindrome (51244422444215).
The spelling of 41103302114101 in words is "forty-one trillion, one hundred three billion, three hundred two million, one hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •