Base | Representation |
---|---|
bin | 111001000110011001101110… |
… | …0001110111010011010101001 |
3 | 2102212100022112210002001001102 |
4 | 1302030303130032322122221 |
5 | 1011312440141121203144 |
6 | 4540113431522531145 |
7 | 210535611620524301 |
oct | 16214633416723251 |
9 | 2385308483061042 |
10 | 502257170491049 |
11 | 136042084a19966 |
12 | 483b897a206ab5 |
13 | 1873385671484c |
14 | 8c0553bb78601 |
15 | 3d0ecdce89b4e |
hex | 1c8ccdc3ba6a9 |
502257170491049 has 2 divisors, whose sum is σ = 502257170491050. Its totient is φ = 502257170491048.
The previous prime is 502257170490961. The next prime is 502257170491061. The reversal of 502257170491049 is 940194071752205.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 498652659403024 + 3604511088025 = 22330532^2 + 1898555^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-502257170491049 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 502257170490985 and 502257170491003.
It is not a weakly prime, because it can be changed into another prime (502257170491099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 251128585245524 + 251128585245525.
It is an arithmetic number, because the mean of its divisors is an integer number (251128585245525).
Almost surely, 2502257170491049 is an apocalyptic number.
It is an amenable number.
502257170491049 is a deficient number, since it is larger than the sum of its proper divisors (1).
502257170491049 is an equidigital number, since it uses as much as digits as its factorization.
502257170491049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6350400, while the sum is 56.
The spelling of 502257170491049 in words is "five hundred two trillion, two hundred fifty-seven billion, one hundred seventy million, four hundred ninety-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •