Base | Representation |
---|---|
bin | 100100110011001001101… |
… | …0000101100110110001101 |
3 | 122220111200010101001201112 |
4 | 1021212103100230312031 |
5 | 1130331030131324031 |
6 | 14431241230421405 |
7 | 1031255132222345 |
oct | 111462320546615 |
9 | 18814603331645 |
10 | 5057647136141 |
11 | 167aa32a57136 |
12 | 698257961865 |
13 | 2a8c1b22a502 |
14 | 136b11969d25 |
15 | 8b86360e62b |
hex | 4999342cd8d |
5057647136141 has 2 divisors, whose sum is σ = 5057647136142. Its totient is φ = 5057647136140.
The previous prime is 5057647136099. The next prime is 5057647136177. The reversal of 5057647136141 is 1416317467505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4914047065225 + 143600070916 = 2216765^2 + 378946^2 .
It is a cyclic number.
It is not a de Polignac number, because 5057647136141 - 230 = 5056573394317 is a prime.
It is a super-3 number, since 3×50576471361413 (a number of 39 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5057647136141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5057647130141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2528823568070 + 2528823568071.
It is an arithmetic number, because the mean of its divisors is an integer number (2528823568071).
Almost surely, 25057647136141 is an apocalyptic number.
It is an amenable number.
5057647136141 is a deficient number, since it is larger than the sum of its proper divisors (1).
5057647136141 is an equidigital number, since it uses as much as digits as its factorization.
5057647136141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2116800, while the sum is 50.
The spelling of 5057647136141 in words is "five trillion, fifty-seven billion, six hundred forty-seven million, one hundred thirty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •