Base | Representation |
---|---|
bin | 100110001110011010… |
… | …101000000011011111 |
3 | 10220221102121210001022 |
4 | 212032122220003133 |
5 | 1133024234101033 |
6 | 30504432234355 |
7 | 2652052445525 |
oct | 461632500337 |
9 | 126842553038 |
10 | 41044050143 |
11 | 164523293a8 |
12 | 7b5569b9bb |
13 | 3b41473905 |
14 | 1db5104315 |
15 | 11034ba098 |
hex | 98e6a80df |
41044050143 has 2 divisors, whose sum is σ = 41044050144. Its totient is φ = 41044050142.
The previous prime is 41044050109. The next prime is 41044050169. The reversal of 41044050143 is 34105044014.
It is a happy number.
41044050143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (41044050169) can be obtained adding 41044050143 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 41044050143 - 28 = 41044049887 is a prime.
It is a super-2 number, since 2×410440501432 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41044050343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20522025071 + 20522025072.
It is an arithmetic number, because the mean of its divisors is an integer number (20522025072).
Almost surely, 241044050143 is an apocalyptic number.
41044050143 is a deficient number, since it is larger than the sum of its proper divisors (1).
41044050143 is an equidigital number, since it uses as much as digits as its factorization.
41044050143 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3840, while the sum is 26.
Adding to 41044050143 its reverse (34105044014), we get a palindrome (75149094157).
The spelling of 41044050143 in words is "forty-one billion, forty-four million, fifty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •