Search a number
-
+
5011105561051 = 34571958374021
BaseRepresentation
bin100100011101011110100…
…1010101011100111011011
3122202001112120012002012011
41020322331022223213123
51124100221010423201
614354023051130351
71025016603321142
oct110727512534733
918661476162164
105011105561051
11166221a4a4997
1268b2291439b7
132a4711b2b675
14134778694759
158a53c6b3151
hex48ebd2ab9db

5011105561051 has 8 divisors (see below), whose sum is σ = 5012878800384. Its totient is φ = 5009332515840.

The previous prime is 5011105560997. The next prime is 5011105561057. The reversal of 5011105561051 is 1501655011105.

5011105561051 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 5011105561051 - 211 = 5011105559003 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 25011105561051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 97061.

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

The spelling of 5011105561051 in words is "five trillion, eleven billion, one hundred five million, five hundred sixty-one thousand, fifty-one".

Divisors: 1 3457 19583 74021 67698431 255890597 1449553243 5011105561051