Search a number
-
+
41103011022 = 2319734774121
BaseRepresentation
bin100110010001111011…
…100010110011001110
310221002112120022011120
4212101323202303032
51133134332323042
630514340101410
72653366554243
oct462173426316
9127075508146
1041103011022
111648263a5a7
127b71394866
133b507488c8
141dbcc915ca
151108764dec
hex991ee2cce

41103011022 has 16 divisors (see below), whose sum is σ = 82623313872. Its totient is φ = 13631455040.

The previous prime is 41103010987. The next prime is 41103011029. The reversal of 41103011022 is 22011030114.

It is a junction number, because it is equal to n+sod(n) for n = 41103010992 and 41103011010.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (41103011029) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17385879 + ... + 17388242.

It is an arithmetic number, because the mean of its divisors is an integer number (5163957117).

Almost surely, 241103011022 is an apocalyptic number.

41103011022 is an abundant number, since it is smaller than the sum of its proper divisors (41520302850).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

41103011022 is a wasteful number, since it uses less digits than its factorization.

41103011022 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 34774323.

The product of its (nonzero) digits is 48, while the sum is 15.

Adding to 41103011022 its reverse (22011030114), we get a palindrome (63114041136).

The spelling of 41103011022 in words is "forty-one billion, one hundred three million, eleven thousand, twenty-two".

Divisors: 1 2 3 6 197 394 591 1182 34774121 69548242 104322363 208644726 6850501837 13701003674 20551505511 41103011022