Base | Representation |
---|---|
bin | 100101011010000111001… |
… | …0000011110000111100001 |
3 | 200012111122002022120101001 |
4 | 1022310032100132013201 |
5 | 1133213403123131001 |
6 | 14533515412312001 |
7 | 1040306402612242 |
oct | 112641620360741 |
9 | 20174562276331 |
10 | 5141315052001 |
11 | 1702468349737 |
12 | 6b0508012601 |
13 | 2b3a9323142b |
14 | 13abab8d2cc9 |
15 | 8db0db08001 |
hex | 4ad0e41e1e1 |
5141315052001 has 8 divisors (see below), whose sum is σ = 5148715221800. Its totient is φ = 5133915302400.
The previous prime is 5141315051959. The next prime is 5141315052011. The reversal of 5141315052001 is 1002505131415.
It can be written as a sum of positive squares in 4 ways, for example, as 1508475240000 + 3632839812001 = 1228200^2 + 1906001^2 .
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 5141315052001 - 235 = 5106955313633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5141315052011) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 30963601 + ... + 31129201.
It is an arithmetic number, because the mean of its divisors is an integer number (643589402725).
Almost surely, 25141315052001 is an apocalyptic number.
It is an amenable number.
5141315052001 is a deficient number, since it is larger than the sum of its proper divisors (7400169799).
5141315052001 is a wasteful number, since it uses less digits than its factorization.
5141315052001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210099.
The product of its (nonzero) digits is 3000, while the sum is 28.
The spelling of 5141315052001 in words is "five trillion, one hundred forty-one billion, three hundred fifteen million, fifty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •