1259
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1260
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1258
- Möbius Function
- -1
- Radical
- 1259
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 83
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 205
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of the form k^2 - k - 1.at n=20A002327
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=54A003147
- a(n) = 3*n^2 + 3*n - 1.at n=20A004538
- Divisible only by primes congruent to 6 mod 7.at n=37A004624
- Odd numbers not of form p + 2^k (de Polignac numbers).at n=24A006285
- Number of sensed loopless planar maps with n edges.at n=7A006390
- A subclass of 2n-node trivalent planar graphs without triangles.at n=6A006796
- Bertrand primes: a(n) is largest prime < 2*a(n-1) for n > 1, with a(1) = 2.at n=11A006992
- a(n) = n OR n^2 (applied to binary expansions).at n=34A007745
- Coordination sequence T4 for Zeolite Code DAC.at n=22A008070
- Coordination sequence T1 for Zeolite Code GOO.at n=24A008111
- Coordination sequence T1 for Zeolite Code MTW.at n=23A008196
- Coordination sequence T3 for Zeolite Code MTW.at n=23A008198
- a(n) = n OR n^2 (applied to ternary expansions).at n=34A008467
- Coordination sequence T7 for Zeolite Code CON.at n=25A009874
- a(n) = floor( n*(n-1)*(n-2)/26 ).at n=33A011908
- a(n) = floor(log(5)^n).at n=15A014216
- Six iterations of Reverse and Add are needed to reach a palindrome.at n=20A015984
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11).at n=35A017842
- Primes with primitive root 8.at n=45A019338