Search a number
-
+
5105010511052 = 224727154311229
BaseRepresentation
bin100101001001001101001…
…0101101000110011001100
3200002000220221220210200022
41022102122111220303030
51132120030142323202
614505113124121312
71034552630243444
oct112223225506314
920060827823608
105105010511052
111699028389791
126a5475836238
132b052897293a
14139126043124
158cbd678bea2
hex4a49a568ccc

5105010511052 has 12 divisors (see below), whose sum is σ = 9123848573280. Its totient is φ = 2498196632976.

The previous prime is 5105010511037. The next prime is 5105010511063. The reversal of 5105010511052 is 2501150105015.

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

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 13577155427 + ... + 13577155802.

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

Almost surely, 25105010511052 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 1250, while the sum is 26.

Adding to 5105010511052 its reverse (2501150105015), we get a palindrome (7606160616067).

The spelling of 5105010511052 in words is "five trillion, one hundred five billion, ten million, five hundred eleven thousand, fifty-two".

Divisors: 1 2 4 47 94 188 27154311229 54308622458 108617244916 1276252627763 2552505255526 5105010511052