Base | Representation |
---|---|
bin | 100101011010001010100… |
… | …1010100011110100001001 |
3 | 200012111221011101102220201 |
4 | 1022310111022203310021 |
5 | 1133214122310133420 |
6 | 14533535112252201 |
7 | 1040312310640651 |
oct | 112642512436411 |
9 | 20174834342821 |
10 | 5141430942985 |
11 | 1702517804307 |
12 | 6b053a9a1061 |
13 | 2b3ab1249c8c |
14 | 13abbd05d361 |
15 | 8db18d9b10a |
hex | 4ad152a3d09 |
5141430942985 has 8 divisors (see below), whose sum is σ = 6171041986056. Its totient is φ = 4112261518080.
The previous prime is 5141430942983. The next prime is 5141430943013. The reversal of 5141430942985 is 5892490341415.
It can be written as a sum of positive squares in 4 ways, for example, as 774718592761 + 4366712350224 = 880181^2 + 2089668^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5141430942985 - 21 = 5141430942983 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5141430942983) 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, 110378926 + ... + 110425495.
It is an arithmetic number, because the mean of its divisors is an integer number (771380248257).
Almost surely, 25141430942985 is an apocalyptic number.
It is an amenable number.
5141430942985 is a deficient number, since it is larger than the sum of its proper divisors (1029611043071).
5141430942985 is a wasteful number, since it uses less digits than its factorization.
5141430942985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220809083.
The product of its (nonzero) digits is 6220800, while the sum is 55.
The spelling of 5141430942985 in words is "five trillion, one hundred forty-one billion, four hundred thirty million, nine hundred forty-two thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •