Base | Representation |
---|---|
bin | 100110011011000110… |
… | …101110000010101001 |
3 | 10221111021012110222121 |
4 | 212123012232002221 |
5 | 1133443233414333 |
6 | 30541515151241 |
7 | 2660246111026 |
oct | 463306560251 |
9 | 127437173877 |
10 | 41256935593 |
11 | 16551512395 |
12 | 7bb4a45521 |
13 | 3b765bcc33 |
14 | 1dd54bc54d |
15 | 111701c32d |
hex | 99b1ae0a9 |
41256935593 has 4 divisors (see below), whose sum is σ = 41466361860. Its totient is φ = 41047509328.
The previous prime is 41256935567. The next prime is 41256935633. The reversal of 41256935593 is 39553965214.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 40460115609 + 796819984 = 201147^2 + 28228^2 .
It is a cyclic number.
It is not a de Polignac number, because 41256935593 - 221 = 41254838441 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41256935593.
It is not an unprimeable number, because it can be changed into a prime (41256936593) 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 in 3 ways as a sum of consecutive naturals, for example, 104712838 + ... + 104713231.
It is an arithmetic number, because the mean of its divisors is an integer number (10366590465).
Almost surely, 241256935593 is an apocalyptic number.
It is an amenable number.
41256935593 is a deficient number, since it is larger than the sum of its proper divisors (209426267).
41256935593 is a wasteful number, since it uses less digits than its factorization.
41256935593 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209426266.
The product of its digits is 4374000, while the sum is 52.
The spelling of 41256935593 in words is "forty-one billion, two hundred fifty-six million, nine hundred thirty-five thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •