Base | Representation |
---|---|
bin | 10010101101011101011101… |
… | …01010100001100001010001 |
3 | 12101200100221112000211212012 |
4 | 21112232232222201201101 |
5 | 20343102234030030223 |
6 | 223301253033512305 |
7 | 11444405064351623 |
oct | 1126565652414121 |
9 | 171610845024765 |
10 | 41144422111313 |
11 | 12123284715854 |
12 | 4746093872695 |
13 | 19c5b9662a6b1 |
14 | a23587582c13 |
15 | 4b53da509c78 |
hex | 256baeaa1851 |
41144422111313 has 2 divisors, whose sum is σ = 41144422111314. Its totient is φ = 41144422111312.
The previous prime is 41144422111291. The next prime is 41144422111327. The reversal of 41144422111313 is 31311122444114.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 40830668652544 + 313753458769 = 6389888^2 + 560137^2 .
It is a cyclic number.
It is not a de Polignac number, because 41144422111313 - 28 = 41144422111057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 41144422111313.
It is not a weakly prime, because it can be changed into another prime (41144422111363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20572211055656 + 20572211055657.
It is an arithmetic number, because the mean of its divisors is an integer number (20572211055657).
Almost surely, 241144422111313 is an apocalyptic number.
It is an amenable number.
41144422111313 is a deficient number, since it is larger than the sum of its proper divisors (1).
41144422111313 is an equidigital number, since it uses as much as digits as its factorization.
41144422111313 is an evil number, because the sum of its binary digits is even.
The product of its digits is 9216, while the sum is 32.
Adding to 41144422111313 its reverse (31311122444114), we get a palindrome (72455544555427).
The spelling of 41144422111313 in words is "forty-one trillion, one hundred forty-four billion, four hundred twenty-two million, one hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •