Base | Representation |
---|---|
bin | 10010110110001000100000… |
… | …11101001011001011111001 |
3 | 12102201212010012012121022002 |
4 | 21123010100131023023321 |
5 | 20412443031333210203 |
6 | 224050214410510345 |
7 | 11505054455511263 |
oct | 1133042035131371 |
9 | 172655105177262 |
10 | 41442415522553 |
11 | 122286a2185231 |
12 | 47939991353b5 |
13 | 1a18006815c76 |
14 | a33b75dd2b33 |
15 | 4bd02b953d88 |
hex | 25b11074b2f9 |
41442415522553 has 2 divisors, whose sum is σ = 41442415522554. Its totient is φ = 41442415522552.
The previous prime is 41442415522549. The next prime is 41442415522577. The reversal of 41442415522553 is 35522551424414.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33165585727849 + 8276829794704 = 5758957^2 + 2876948^2 .
It is a cyclic number.
It is not a de Polignac number, because 41442415522553 - 22 = 41442415522549 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41442415522498 and 41442415522507.
It is not a weakly prime, because it can be changed into another prime (41442415522853) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20721207761276 + 20721207761277.
It is an arithmetic number, because the mean of its divisors is an integer number (20721207761277).
Almost surely, 241442415522553 is an apocalyptic number.
It is an amenable number.
41442415522553 is a deficient number, since it is larger than the sum of its proper divisors (1).
41442415522553 is an equidigital number, since it uses as much as digits as its factorization.
41442415522553 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3840000, while the sum is 47.
Adding to 41442415522553 its reverse (35522551424414), we get a palindrome (76964966946967).
The spelling of 41442415522553 in words is "forty-one trillion, four hundred forty-two billion, four hundred fifteen million, five hundred twenty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •