Base | Representation |
---|---|
bin | 100110001111000100… |
… | …100100110000111101 |
3 | 10220222012022110111211 |
4 | 212033010210300331 |
5 | 1133040042443332 |
6 | 30505504044421 |
7 | 2652245065516 |
oct | 461704446075 |
9 | 126865273454 |
10 | 41055046717 |
11 | 1645855a283 |
12 | 7b59303711 |
13 | 3b43823c69 |
14 | 1db6767a0d |
15 | 110443d447 |
hex | 98f124c3d |
41055046717 has 2 divisors, whose sum is σ = 41055046718. Its totient is φ = 41055046716.
The previous prime is 41055046679. The next prime is 41055046771. The reversal of 41055046717 is 71764055014.
Together with next prime (41055046771) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26247564121 + 14807482596 = 162011^2 + 121686^2 .
It is a cyclic number.
It is not a de Polignac number, because 41055046717 - 215 = 41055013949 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 41055046717.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41055046217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20527523358 + 20527523359.
It is an arithmetic number, because the mean of its divisors is an integer number (20527523359).
Almost surely, 241055046717 is an apocalyptic number.
It is an amenable number.
41055046717 is a deficient number, since it is larger than the sum of its proper divisors (1).
41055046717 is an equidigital number, since it uses as much as digits as its factorization.
41055046717 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 117600, while the sum is 40.
The spelling of 41055046717 in words is "forty-one billion, fifty-five million, forty-six thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •