Base | Representation |
---|---|
bin | 10010111001101111101101… |
… | …11011011101010011001001 |
3 | 12110011201111201202200101001 |
4 | 21130313312323131103021 |
5 | 20422011234033230113 |
6 | 224223223325055001 |
7 | 11520040433324113 |
oct | 1134676673352311 |
9 | 173151451680331 |
10 | 41566541305033 |
11 | 122762a8a24838 |
12 | 47b3a5a6b7461 |
13 | 1a269286c1934 |
14 | a39b8d2723b3 |
15 | 4c1393c287dd |
hex | 25cdf6edd4c9 |
41566541305033 has 2 divisors, whose sum is σ = 41566541305034. Its totient is φ = 41566541305032.
The previous prime is 41566541305031. The next prime is 41566541305067. The reversal of 41566541305033 is 33050314566514.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39452317707664 + 2114223597369 = 6281108^2 + 1454037^2 .
It is a cyclic number.
It is not a de Polignac number, because 41566541305033 - 21 = 41566541305031 is a prime.
It is a super-2 number, since 2×415665413050332 (a number of 28 digits) contains 22 as substring.
Together with 41566541305031, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (41566541305031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20783270652516 + 20783270652517.
It is an arithmetic number, because the mean of its divisors is an integer number (20783270652517).
Almost surely, 241566541305033 is an apocalyptic number.
It is an amenable number.
41566541305033 is a deficient number, since it is larger than the sum of its proper divisors (1).
41566541305033 is an equidigital number, since it uses as much as digits as its factorization.
41566541305033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944000, while the sum is 46.
The spelling of 41566541305033 in words is "forty-one trillion, five hundred sixty-six billion, five hundred forty-one million, three hundred five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •