Base | Representation |
---|---|
bin | 10010110000011001001110… |
… | …10010100001111100110001 |
3 | 12102001000011000001220110001 |
4 | 21120030213102201330301 |
5 | 20401230212402100221 |
6 | 223415444103110001 |
7 | 11454604152260116 |
oct | 1130144722417461 |
9 | 172030130056401 |
10 | 41245230112561 |
11 | 12162005157182 |
12 | 4761728142301 |
13 | 1a02540661b87 |
14 | a283cba5290d |
15 | 4b7d3a64c391 |
hex | 2583274a1f31 |
41245230112561 has 2 divisors, whose sum is σ = 41245230112562. Its totient is φ = 41245230112560.
The previous prime is 41245230112501. The next prime is 41245230112573. The reversal of 41245230112561 is 16521103254214.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41244139065600 + 1091046961 = 6422160^2 + 33031^2 .
It is a cyclic number.
It is not a de Polignac number, because 41245230112561 - 239 = 40695474298673 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 41245230112561.
It is not a weakly prime, because it can be changed into another prime (41245230112501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20622615056280 + 20622615056281.
It is an arithmetic number, because the mean of its divisors is an integer number (20622615056281).
Almost surely, 241245230112561 is an apocalyptic number.
It is an amenable number.
41245230112561 is a deficient number, since it is larger than the sum of its proper divisors (1).
41245230112561 is an equidigital number, since it uses as much as digits as its factorization.
41245230112561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 37.
Adding to 41245230112561 its reverse (16521103254214), we get a palindrome (57766333366775).
The spelling of 41245230112561 in words is "forty-one trillion, two hundred forty-five billion, two hundred thirty million, one hundred twelve thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •