Base | Representation |
---|---|
bin | 100101011010100110000… |
… | …0111001010100001000001 |
3 | 200012121022102000121202001 |
4 | 1022311030013022201001 |
5 | 1133223014304043214 |
6 | 14534210403024001 |
7 | 1040344203411121 |
oct | 112651407124101 |
9 | 20177272017661 |
10 | 5142352799809 |
11 | 1702950104a55 |
12 | 6b075766b001 |
13 | 2b3bca226ca4 |
14 | 13ac69668c81 |
15 | 8db6ec93c74 |
hex | 4ad4c1ca841 |
5142352799809 has 2 divisors, whose sum is σ = 5142352799810. Its totient is φ = 5142352799808.
The previous prime is 5142352799743. The next prime is 5142352799819. The reversal of 5142352799809 is 9089972532415.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5043042731584 + 99310068225 = 2245672^2 + 315135^2 .
It is a cyclic number.
It is not a de Polignac number, because 5142352799809 - 27 = 5142352799681 is a prime.
It is a super-2 number, since 2×51423527998092 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5142352799819) by changing a digit.
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 as a sum of consecutive naturals, namely, 2571176399904 + 2571176399905.
It is an arithmetic number, because the mean of its divisors is an integer number (2571176399905).
Almost surely, 25142352799809 is an apocalyptic number.
It is an amenable number.
5142352799809 is a deficient number, since it is larger than the sum of its proper divisors (1).
5142352799809 is an equidigital number, since it uses as much as digits as its factorization.
5142352799809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48988800, while the sum is 64.
The spelling of 5142352799809 in words is "five trillion, one hundred forty-two billion, three hundred fifty-two million, seven hundred ninety-nine thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •