Base | Representation |
---|---|
bin | 100100011000101110100… |
… | …1110011110100011010111 |
3 | 122201002012201221010211100 |
4 | 1020301131032132203113 |
5 | 1123413323414240131 |
6 | 14345215015241143 |
7 | 1024206053465160 |
oct | 110613516364327 |
9 | 18632181833740 |
10 | 5000906008791 |
11 | 1658966083360 |
12 | 6892613791b3 |
13 | 2a37779b2944 |
14 | 13408bc28767 |
15 | 8a1420387e6 |
hex | 48c5d39e8d7 |
5000906008791 has 48 divisors (see below), whose sum is σ = 9175884456960. Its totient is φ = 2548856756160.
The previous prime is 5000906008751. The next prime is 5000906008811. The reversal of 5000906008791 is 1978006090005.
5000906008791 is a `hidden beast` number, since 500 + 0 + 9 + 0 + 60 + 0 + 87 + 9 + 1 = 666.
5000906008791 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5000906008791 - 211 = 5000906006743 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5000906008741) 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 47 ways as a sum of consecutive naturals, for example, 68041711 + ... + 68115168.
It is an arithmetic number, because the mean of its divisors is an integer number (191164259520).
Almost surely, 25000906008791 is an apocalyptic number.
5000906008791 is a deficient number, since it is larger than the sum of its proper divisors (4174978448169).
5000906008791 is a wasteful number, since it uses less digits than its factorization.
5000906008791 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136156956 (or 136156953 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 45.
The spelling of 5000906008791 in words is "five trillion, nine hundred six million, eight thousand, seven hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •