Search a number
-
+
41302072435 = 5136191026521
BaseRepresentation
bin100110011101110010…
…111001110001110011
310221121102010200002111
4212131302321301303
51134041312304220
630550210430151
72661334552231
oct463562716163
9127542120074
1041302072435
1116574a41368
128007b92357
133b82a64920
141ddb4ab951
15111ae8615a
hex99dcb9c73

41302072435 has 16 divisors (see below), whose sum is σ = 53461265760. Its totient is φ = 30450689280.

The previous prime is 41302072429. The next prime is 41302072523. The reversal of 41302072435 is 53427020314.

It is a happy number.

It is not a de Polignac number, because 41302072435 - 219 = 41301548147 is a prime.

It is a super-2 number, since 2×413020724352 (a number of 22 digits) contains 22 as substring.

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

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 473026 + ... + 553495.

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

Almost surely, 241302072435 is an apocalyptic number.

41302072435 is a deficient number, since it is larger than the sum of its proper divisors (12159193325).

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

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

The sum of its prime factors is 1027158.

The product of its (nonzero) digits is 20160, while the sum is 31.

Adding to 41302072435 its reverse (53427020314), we get a palindrome (94729092749).

The spelling of 41302072435 in words is "forty-one billion, three hundred two million, seventy-two thousand, four hundred thirty-five".

Divisors: 1 5 13 65 619 3095 8047 40235 1026521 5132605 13344773 66723865 635416499 3177082495 8260414487 41302072435