2783
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 3192
- Proper Divisor Sum (Aliquot Sum)
- 409
- 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
- 2420
- Möbius Function
- 0
- Radical
- 253
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 115
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Permanent of a certain cyclic n X n (0,1) matrix.at n=9A000804
- Number of permutations p of [n] such that (n-p(i)+i) mod n >= 4 for all i.at n=5A004307
- Number of paraffins.at n=21A005997
- Ruth-Aaron numbers (1): sum of prime divisors of n = sum of prime divisors of n+1.at n=13A006145
- Coordination sequence T2 for Zeolite Code MOR.at n=34A008183
- Coordination sequence T4 for Zeolite Code MOR.at n=34A008185
- Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1.at n=40A008305
- Numbers k that divide s(k), where s(1)=1, s(j)=23*s(j-1)+j.at n=6A014874
- Positive integers k such that k divides 12^k - 1.at n=5A014951
- Numbers k such that k | 10^k + 1.at n=5A015958
- Fibonacci sequence beginning 7, 15.at n=12A022389
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=27A024843
- dot product (n,n-1,...2,1).(3,4,...,n,1,2).at n=20A026054
- a(n) = floor( e * 2^n ).at n=10A027437
- Divisors of 10^11 + 1.at n=5A027899
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 23 (most significant digit on left).at n=16A029468
- Positions of record values in A030777.at n=46A030782
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 11 ones.at n=4A031779
- Number of dyslexic rooted compound windmills with n nodes where any 2 submills extending from the same node are different sizes.at n=13A032218
- Write 1,2,... in a clockwise spiral; sequence gives numbers on positive x axis.at n=26A033951