Search a number
-
+
500412002111 = 7227313739469
BaseRepresentation
bin1110100100000101110…
…00010010111100111111
31202211122120110120212222
413102002320102330333
531144320433031421
61021515221515555
751103450556600
oct7220270227477
91684576416788
10500412002111
1118325059080a
1280b96b72bbb
133825b6022c8
141a311c2dda7
15d03bdb7cab
hex7482e12f3f

500412002111 has 12 divisors (see below), whose sum is σ = 582325226280. Its totient is φ = 428767400880.

The previous prime is 500412002107. The next prime is 500412002131. The reversal of 500412002111 is 111200214005.

It is not a de Polignac number, because 500412002111 - 22 = 500412002107 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 500412002111.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1735916 + ... + 2003553.

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

Almost surely, 2500412002111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3742214 (or 3742207 counting only the distinct ones).

The product of its (nonzero) digits is 80, while the sum is 17.

Adding to 500412002111 its reverse (111200214005), we get a palindrome (611612216116).

The spelling of 500412002111 in words is "five hundred billion, four hundred twelve million, two thousand, one hundred eleven".

Divisors: 1 7 49 2731 19117 133819 3739469 26176283 183233981 10212489839 71487428873 500412002111