Base | Representation |
---|---|
bin | 100101011010011010100… |
… | …1100110110110100011101 |
3 | 200012120022121201220022202 |
4 | 1022310311030312310131 |
5 | 1133221222403303104 |
6 | 14534104312221245 |
7 | 1040331525246524 |
oct | 112646514666435 |
9 | 20176277656282 |
10 | 5141968416029 |
11 | 1702773135805 |
12 | 6b066a99a825 |
13 | 2b3b686c2673 |
14 | 13ac305ab4bb |
15 | 8db4b16751e |
hex | 4ad35336d1d |
5141968416029 has 2 divisors, whose sum is σ = 5141968416030. Its totient is φ = 5141968416028.
The previous prime is 5141968415999. The next prime is 5141968416031. The reversal of 5141968416029 is 9206148691415.
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., 4582018519225 + 559949896804 = 2140565^2 + 748298^2 .
It is a cyclic number.
It is not a de Polignac number, because 5141968416029 - 212 = 5141968411933 is a prime.
Together with 5141968416031, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5141968416049) 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, 2570984208014 + 2570984208015.
It is an arithmetic number, because the mean of its divisors is an integer number (2570984208015).
Almost surely, 25141968416029 is an apocalyptic number.
It is an amenable number.
5141968416029 is a deficient number, since it is larger than the sum of its proper divisors (1).
5141968416029 is an equidigital number, since it uses as much as digits as its factorization.
5141968416029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3732480, while the sum is 56.
The spelling of 5141968416029 in words is "five trillion, one hundred forty-one billion, nine hundred sixty-eight million, four hundred sixteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •