Base | Representation |
---|---|
bin | 100100110000001101011… |
… | …0010100110011000001001 |
3 | 122212220100221110201101200 |
4 | 1021200122302212120021 |
5 | 1130230111214341410 |
6 | 14424314402134413 |
7 | 1030642456110510 |
oct | 111403262463011 |
9 | 18786327421350 |
10 | 5051331012105 |
11 | 1678291739714 |
12 | 696b94651409 |
13 | 2a8452809801 |
14 | 1366b2b8b677 |
15 | 8b5e3d803c0 |
hex | 4981aca6609 |
5051331012105 has 96 divisors (see below), whose sum is σ = 10241062191360. Its totient is φ = 2255057763840.
The previous prime is 5051331012089. The next prime is 5051331012187. The reversal of 5051331012105 is 5012101331505.
5051331012105 is a `hidden beast` number, since 5 + 0 + 513 + 31 + 0 + 12 + 105 = 666.
It is not a de Polignac number, because 5051331012105 - 24 = 5051331012089 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 79355431 + ... + 79419059.
It is an arithmetic number, because the mean of its divisors is an integer number (106677731160).
Almost surely, 25051331012105 is an apocalyptic number.
It is an amenable number.
5051331012105 is an abundant number, since it is smaller than the sum of its proper divisors (5189731179255).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5051331012105 is a wasteful number, since it uses less digits than its factorization.
5051331012105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69551 (or 69548 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
The spelling of 5051331012105 in words is "five trillion, fifty-one billion, three hundred thirty-one million, twelve thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •