Base | Representation |
---|---|
bin | 100110101011101111… |
… | …101011111111101001 |
3 | 10222012201112001001112 |
4 | 212223233223333221 |
5 | 1140031221014234 |
6 | 31025331000105 |
7 | 3000206054162 |
oct | 465357537751 |
9 | 128181461045 |
10 | 41536110569 |
11 | 16685062708 |
12 | 8072439035 |
13 | 3bbc3a8c25 |
14 | 20205d0769 |
15 | 11317b5ace |
hex | 9abbebfe9 |
41536110569 has 2 divisors, whose sum is σ = 41536110570. Its totient is φ = 41536110568.
The previous prime is 41536110541. The next prime is 41536110589. The reversal of 41536110569 is 96501163514.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41285363344 + 250747225 = 203188^2 + 15835^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41536110569 is a prime.
It is a super-2 number, since 2×415361105692 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (41536110509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20768055284 + 20768055285.
It is an arithmetic number, because the mean of its divisors is an integer number (20768055285).
Almost surely, 241536110569 is an apocalyptic number.
It is an amenable number.
41536110569 is a deficient number, since it is larger than the sum of its proper divisors (1).
41536110569 is an equidigital number, since it uses as much as digits as its factorization.
41536110569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97200, while the sum is 41.
The spelling of 41536110569 in words is "forty-one billion, five hundred thirty-six million, one hundred ten thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •