2503
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2504
- 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
- 2502
- Möbius Function
- -1
- Radical
- 2503
- 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
- 63
- 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
- 368
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=33A000923
- Smallest prime p such that there is a gap of 2n between p and previous prime.at n=12A001632
- a(0) = 1, a(1) = 2, a(2) = 3; for n >= 3, a(n) = a(n-2) + a(n-1)*Product_{i=1..n-3} a(i).at n=6A001685
- Number of unrooted triangulations of a pentagon with n internal nodes.at n=5A005501
- Odd numbers not of form p + 2^k (de Polignac numbers).at n=57A006285
- Prime self (or Colombian) numbers: primes not expressible as the sum of an integer and its digit sum.at n=37A006378
- Bertrand primes: a(n) is largest prime < 2*a(n-1) for n > 1, with a(1) = 2.at n=12A006992
- Smallest prime > n^2.at n=49A007491
- Coordination sequence T1 for Zeolite Code MFS.at n=31A008173
- Molien series for alternating group Alt_12 (or A_12).at n=27A008635
- Number of partitions of n into at most 12 parts.at n=27A008641
- Coordination sequence T5 for Zeolite Code -CLO.at n=44A009854
- Numbers k such that the continued fraction for sqrt(k) has period 52.at n=5A020391
- a(n) = prime(8*n).at n=45A031341
- a(n) = prime(9n-1).at n=40A031375
- a(n) = prime(10*n - 2).at n=36A031384
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 49.at n=8A031547
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 22 ones.at n=25A031790
- Lower prime of a difference of 18 between consecutive primes.at n=7A031936
- Primes of form x^2+51*y^2.at n=25A033233