Base | Representation |
---|---|
bin | 100100011000010110110… |
… | …0100111111100111111011 |
3 | 122201000011000201020001102 |
4 | 1020300231210333213323 |
5 | 1123410204242330201 |
6 | 14345003421242015 |
7 | 1024150205614055 |
oct | 110605544774773 |
9 | 18630130636042 |
10 | 5000106605051 |
11 | 165859590a508 |
12 | 68907970330b |
13 | 2a367b1ab28c |
14 | 1340139b68d5 |
15 | 8a0e6c7d26b |
hex | 48c2d93f9fb |
5000106605051 has 4 divisors (see below), whose sum is σ = 5263270110600. Its totient is φ = 4736943099504.
The previous prime is 5000106605041. The next prime is 5000106605057. The reversal of 5000106605051 is 1505066010005.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5000106605051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5000106605057) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 131581752746 + ... + 131581752783.
It is an arithmetic number, because the mean of its divisors is an integer number (1315817527650).
Almost surely, 25000106605051 is an apocalyptic number.
5000106605051 is a deficient number, since it is larger than the sum of its proper divisors (263163505549).
5000106605051 is a wasteful number, since it uses less digits than its factorization.
5000106605051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263163505548.
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 5000106605051 in words is "five trillion, one hundred six million, six hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •