Base | Representation |
---|---|
bin | 100100101001011001110… |
… | …1111001110010010011101 |
3 | 122211111122110221201022121 |
4 | 1021102303233032102131 |
5 | 1130010144043444434 |
6 | 14413500320542541 |
7 | 1026614355400345 |
oct | 111226357162235 |
9 | 18744573851277 |
10 | 5036717171869 |
11 | 167207259a1a9 |
12 | 694196481a51 |
13 | 2a6c63c97576 |
14 | 135ac7d67d25 |
15 | 8b03ade87b4 |
hex | 494b3bce49d |
5036717171869 has 2 divisors, whose sum is σ = 5036717171870. Its totient is φ = 5036717171868.
The previous prime is 5036717171839. The next prime is 5036717171923. The reversal of 5036717171869 is 9681717176305.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4870575335844 + 166141836025 = 2206938^2 + 407605^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5036717171869 is a prime.
It is a super-2 number, since 2×50367171718692 (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 (5036717171839) 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, 2518358585934 + 2518358585935.
It is an arithmetic number, because the mean of its divisors is an integer number (2518358585935).
Almost surely, 25036717171869 is an apocalyptic number.
It is an amenable number.
5036717171869 is a deficient number, since it is larger than the sum of its proper divisors (1).
5036717171869 is an equidigital number, since it uses as much as digits as its factorization.
5036717171869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13335840, while the sum is 61.
The spelling of 5036717171869 in words is "five trillion, thirty-six billion, seven hundred seventeen million, one hundred seventy-one thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •