Base | Representation |
---|---|
bin | 10010110100101000010110… |
… | …10011110001001001001001 |
3 | 12102112220212021212010102022 |
4 | 21122110023103301021021 |
5 | 20411121314112003303 |
6 | 224010355523214225 |
7 | 11501246231215445 |
oct | 1132241323611111 |
9 | 172486767763368 |
10 | 41390789562953 |
11 | 1220880a71a716 |
12 | 478598b817375 |
13 | 1a13199c5158c |
14 | a31479771825 |
15 | 4bba09483438 |
hex | 25a50b4f1249 |
41390789562953 has 16 divisors (see below), whose sum is σ = 42048943607952. Its totient is φ = 40737580800000.
The previous prime is 41390789562949. The next prime is 41390789563003. The reversal of 41390789562953 is 35926598709314.
It can be written as a sum of positive squares in 8 ways, for example, as 239436998329 + 41151352564624 = 489323^2 + 6414932^2 .
It is a cyclic number.
It is not a de Polignac number, because 41390789562953 - 22 = 41390789562949 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41390789562923) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 110959553 + ... + 111331953.
It is an arithmetic number, because the mean of its divisors is an integer number (2628058975497).
It is a 1-persistent number, because it is pandigital, but 2⋅41390789562953 = 82781579125906 is not.
Almost surely, 241390789562953 is an apocalyptic number.
It is an amenable number.
41390789562953 is a deficient number, since it is larger than the sum of its proper divisors (658154044999).
41390789562953 is a wasteful number, since it uses less digits than its factorization.
41390789562953 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 379036.
The product of its (nonzero) digits is 440899200, while the sum is 71.
The spelling of 41390789562953 in words is "forty-one trillion, three hundred ninety billion, seven hundred eighty-nine million, five hundred sixty-two thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •