Base | Representation |
---|---|
bin | 11010111110001010110… |
… | …101001011111101100101 |
3 | 20120012002211011210002222 |
4 | 122332022311023331211 |
5 | 220331341241244023 |
6 | 3535245014242125 |
7 | 250623316634501 |
oct | 32761265137545 |
9 | 6505084153088 |
10 | 1853460103013 |
11 | 6550589aa302 |
12 | 25b268056345 |
13 | 105a1bac285c |
14 | 659ca873301 |
15 | 3332d078cc8 |
hex | 1af8ad4bf65 |
1853460103013 has 2 divisors, whose sum is σ = 1853460103014. Its totient is φ = 1853460103012.
The previous prime is 1853460102979. The next prime is 1853460103021. The reversal of 1853460103013 is 3103010643581.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1852557821569 + 902281444 = 1361087^2 + 30038^2 .
It is an emirp because it is prime and its reverse (3103010643581) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1853460103013 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1853460703013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 926730051506 + 926730051507.
It is an arithmetic number, because the mean of its divisors is an integer number (926730051507).
Almost surely, 21853460103013 is an apocalyptic number.
It is an amenable number.
1853460103013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1853460103013 is an equidigital number, since it uses as much as digits as its factorization.
1853460103013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 35.
Adding to 1853460103013 its reverse (3103010643581), we get a palindrome (4956470746594).
The spelling of 1853460103013 in words is "one trillion, eight hundred fifty-three billion, four hundred sixty million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •