Search a number
-
+
5111061110644 = 225923215729407
BaseRepresentation
bin100101001100000001011…
…1110110101111101110100
3200002121112122012002221111
41022120002332311331310
51132214423121020034
614511553345324404
71035155600424466
oct112300276657564
920077478162844
105111061110644
1116a065282a815
126a6684036704
132b0c81376998
1413953b864136
158ce3ca6c364
hex4a602fb5f74

5111061110644 has 12 divisors (see below), whose sum is σ = 8945867090944. Its totient is φ = 2555099084664.

The previous prime is 5111061110641. The next prime is 5111061110723. The reversal of 5111061110644 is 4460111601115.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5111061110641) 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 3 ways as a sum of consecutive naturals, for example, 107841012 + ... + 107888395.

Almost surely, 25111061110644 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 5111061110644 its reverse (4460111601115), we get a palindrome (9571172711759).

The spelling of 5111061110644 in words is "five trillion, one hundred eleven billion, sixty-one million, one hundred ten thousand, six hundred forty-four".

Divisors: 1 2 4 5923 11846 23692 215729407 431458814 862917628 1277765277661 2555530555322 5111061110644