Base | Representation |
---|---|
bin | 100101011010010100011… |
… | …1011110001101101100101 |
3 | 200012112210021110222100212 |
4 | 1022310220323301231211 |
5 | 1133220312212041234 |
6 | 14534032041145205 |
7 | 1040323446040136 |
oct | 112645073615545 |
9 | 20175707428325 |
10 | 5141762612069 |
11 | 1702677a49196 |
12 | 6b0611a8b205 |
13 | 2b3b34b85685 |
14 | 13ac11117c8d |
15 | 8db380635ce |
hex | 4ad28ef1b65 |
5141762612069 has 2 divisors, whose sum is σ = 5141762612070. Its totient is φ = 5141762612068.
The previous prime is 5141762612053. The next prime is 5141762612137. The reversal of 5141762612069 is 9602162671415.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4930220568100 + 211542043969 = 2220410^2 + 459937^2 .
It is a cyclic number.
It is not a de Polignac number, because 5141762612069 - 24 = 5141762612053 is a prime.
It is a super-2 number, since 2×51417626120692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5141762612969) 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 as a sum of consecutive naturals, namely, 2570881306034 + 2570881306035.
It is an arithmetic number, because the mean of its divisors is an integer number (2570881306035).
Almost surely, 25141762612069 is an apocalyptic number.
It is an amenable number.
5141762612069 is a deficient number, since it is larger than the sum of its proper divisors (1).
5141762612069 is an equidigital number, since it uses as much as digits as its factorization.
5141762612069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 50.
The spelling of 5141762612069 in words is "five trillion, one hundred forty-one billion, seven hundred sixty-two million, six hundred twelve thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •