Base | Representation |
---|---|
bin | 100101001101001110100… |
… | …0110000001111011111101 |
3 | 200002212012211101221110211 |
4 | 1022122131012001323331 |
5 | 1132240222022422244 |
6 | 14513102111232421 |
7 | 1035306634440064 |
oct | 112323506017375 |
9 | 20085184357424 |
10 | 5113646685949 |
11 | 16a175a27280a |
12 | 6a7085b18711 |
13 | 2b12a3c390b9 |
14 | 139704dcd1db |
15 | 8d03ea4d934 |
hex | 4a69d181efd |
5113646685949 has 2 divisors, whose sum is σ = 5113646685950. Its totient is φ = 5113646685948.
The previous prime is 5113646685937. The next prime is 5113646685971. The reversal of 5113646685949 is 9495866463115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4030028145049 + 1083618540900 = 2007493^2 + 1040970^2 .
It is a cyclic number.
It is not a de Polignac number, because 5113646685949 - 231 = 5111499202301 is a prime.
It is a super-2 number, since 2×51136466859492 (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 (5113646685989) 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, 2556823342974 + 2556823342975.
It is an arithmetic number, because the mean of its divisors is an integer number (2556823342975).
Almost surely, 25113646685949 is an apocalyptic number.
It is an amenable number.
5113646685949 is a deficient number, since it is larger than the sum of its proper divisors (1).
5113646685949 is an equidigital number, since it uses as much as digits as its factorization.
5113646685949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 167961600, while the sum is 67.
The spelling of 5113646685949 in words is "five trillion, one hundred thirteen billion, six hundred forty-six million, six hundred eighty-five thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •