2713
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2714
- 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
- 2712
- Möbius Function
- -1
- Radical
- 2713
- 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
- 159
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 396
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=34A007077
- a(n) = a(n-2) + a(n-3), with a(0) = 0, a(1) = 1, a(2) = 2.at n=29A007307
- Coordination sequence T4 for Zeolite Code AET.at n=36A008010
- Coordination sequence T4 for Zeolite Code DOH.at n=32A008081
- Coordination sequence T2 for Zeolite Code MFI.at n=33A008165
- Coordination sequence T5 for Zeolite Code MFI.at n=33A008168
- a(n) = 3*n*a(n-1) + 1, a(0) = 1.at n=4A010845
- Numbers k such that the continued fraction for sqrt(k) has period 15.at n=15A020354
- Primes that remain prime through 2 iterations of the function f(x) = 2x + 5.at n=38A023243
- Primes that remain prime through 2 iterations of function f(x) = 8x + 9.at n=23A023264
- Primes that remain prime through 3 iterations of function f(x) = 2x + 5.at n=17A023274
- Partial sums of the partition numbers A000041 of the positive integers.at n=19A026905
- a(n) = T(n,2n-4), T given by A027052.at n=8A027060
- Number of partitions of n that do not contain 10 as a part.at n=27A027344
- Positions of record values in A030767.at n=52A030772
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 34.at n=0A031622
- a(n) = prime(10*n - 4).at n=39A031905
- Primes of form x^2+93*y^2.at n=45A033202
- Primes of form x^2+31*y^2.at n=60A033221
- Primes of the form x^2+74*y^2.at n=16A033248