Base | Representation |
---|---|
bin | 100110001110111101… |
… | …101110001111100111 |
3 | 10220222001221012121120 |
4 | 212032331232033213 |
5 | 1133034113004120 |
6 | 30505401345023 |
7 | 2652223605033 |
oct | 461675561747 |
9 | 126861835546 |
10 | 41053250535 |
11 | 16457542830 |
12 | 7b58798173 |
13 | 3b4334552b |
14 | 1db641b1c3 |
15 | 11041d6140 |
hex | 98ef6e3e7 |
41053250535 has 32 divisors (see below), whose sum is σ = 72638201088. Its totient is φ = 19631934720.
The previous prime is 41053250533. The next prime is 41053250593. The reversal of 41053250535 is 53505235014.
It is a happy number.
It is not a de Polignac number, because 41053250535 - 21 = 41053250533 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 41053250496 and 41053250505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41053250533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1692117 + ... + 1716206.
It is an arithmetic number, because the mean of its divisors is an integer number (2269943784).
Almost surely, 241053250535 is an apocalyptic number.
41053250535 is a deficient number, since it is larger than the sum of its proper divisors (31584950553).
41053250535 is a wasteful number, since it uses less digits than its factorization.
41053250535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3408415.
The product of its (nonzero) digits is 45000, while the sum is 33.
Adding to 41053250535 its reverse (53505235014), we get a palindrome (94558485549).
The spelling of 41053250535 in words is "forty-one billion, fifty-three million, two hundred fifty thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •